/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:05:52,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:05:52,257 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 18:05:52,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:05:52,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:05:52,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:05:52,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:05:52,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:05:52,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:05:52,316 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:05:52,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:05:52,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:05:52,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:05:52,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:05:52,316 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:05:52,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:05:52,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:05:52,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:05:52,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:05:52,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:05:52,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:05:52,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:05:52,329 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 [2025-04-13 18:05:52,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:05:52,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:05:52,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:05:52,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:05:52,848 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:05:52,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-13 18:05:54,963 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a03a98e2/b5449d9307a5414eb3eaff222f9da771/FLAGc2cb81b49 [2025-04-13 18:05:55,417 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:05:55,418 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-13 18:05:55,435 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a03a98e2/b5449d9307a5414eb3eaff222f9da771/FLAGc2cb81b49 [2025-04-13 18:05:56,068 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a03a98e2/b5449d9307a5414eb3eaff222f9da771 [2025-04-13 18:05:56,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:05:56,074 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:05:56,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:05:56,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:05:56,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:05:56,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78919420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56, skipping insertion in model container [2025-04-13 18:05:56,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:05:56,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-04-13 18:05:56,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:05:56,588 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:05:56,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-04-13 18:05:56,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:05:56,713 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:05:56,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56 WrapperNode [2025-04-13 18:05:56,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:05:56,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:05:56,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:05:56,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:05:56,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,776 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 288 [2025-04-13 18:05:56,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:05:56,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:05:56,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:05:56,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:05:56,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,832 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 18:05:56,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:05:56,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:05:56,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:05:56,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:05:56,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (1/1) ... [2025-04-13 18:05:56,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:05:56,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:56,943 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 18:05:56,954 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 18:05:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:05:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:05:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:05:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:05:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:05:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:05:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:05:56,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:05:56,990 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:05:57,127 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:05:57,135 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:05:57,794 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:05:57,795 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:05:57,795 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:05:58,509 INFO L313 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-13 18:05:58,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:05:58 BoogieIcfgContainer [2025-04-13 18:05:58,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:05:58,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:05:58,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:05:58,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:05:58,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:05:56" (1/3) ... [2025-04-13 18:05:58,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbf81bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:05:58, skipping insertion in model container [2025-04-13 18:05:58,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:05:56" (2/3) ... [2025-04-13 18:05:58,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbf81bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:05:58, skipping insertion in model container [2025-04-13 18:05:58,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:05:58" (3/3) ... [2025-04-13 18:05:58,519 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-04-13 18:05:58,534 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:05:58,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 37 locations, 37 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 18:05:58,536 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:05:58,621 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:05:58,654 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 41 transitions, 110 flow [2025-04-13 18:05:59,021 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1720 states, 1719 states have (on average 4.296684118673648) internal successors, (7386), 1719 states have internal predecessors, (7386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:59,082 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:05:59,107 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;@56a0727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:05:59,108 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:05:59,130 INFO L278 IsEmpty]: Start isEmpty. Operand has 1720 states, 1719 states have (on average 4.296684118673648) internal successors, (7386), 1719 states have internal predecessors, (7386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:59,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:05:59,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:59,196 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 18:05:59,197 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:05:59,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2126705779, now seen corresponding path program 1 times [2025-04-13 18:05:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:59,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028117407] [2025-04-13 18:05:59,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:05:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:59,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:05:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:05:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:59,794 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 18:05:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:59,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028117407] [2025-04-13 18:05:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028117407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:59,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:59,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:05:59,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890929466] [2025-04-13 18:05:59,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:59,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:05:59,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:59,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:05:59,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:05:59,831 INFO L87 Difference]: Start difference. First operand has 1720 states, 1719 states have (on average 4.296684118673648) internal successors, (7386), 1719 states have internal predecessors, (7386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 11.5) 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 18:06:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:00,198 INFO L93 Difference]: Finished difference Result 3429 states and 14741 transitions. [2025-04-13 18:06:00,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:06:00,209 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) 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 18:06:00,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:00,280 INFO L225 Difference]: With dead ends: 3429 [2025-04-13 18:06:00,281 INFO L226 Difference]: Without dead ends: 3422 [2025-04-13 18:06:00,287 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 18:06:00,290 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:00,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:06:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2025-04-13 18:06:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 1986. [2025-04-13 18:06:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1985 states have (on average 4.278589420654912) internal successors, (8493), 1985 states have internal predecessors, (8493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 8493 transitions. [2025-04-13 18:06:00,672 INFO L79 Accepts]: Start accepts. Automaton has 1986 states and 8493 transitions. Word has length 23 [2025-04-13 18:06:00,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:00,673 INFO L485 AbstractCegarLoop]: Abstraction has 1986 states and 8493 transitions. [2025-04-13 18:06:00,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) 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 18:06:00,674 INFO L278 IsEmpty]: Start isEmpty. Operand 1986 states and 8493 transitions. [2025-04-13 18:06:00,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:06:00,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:00,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:00,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:06:00,691 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:00,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2074682433, now seen corresponding path program 1 times [2025-04-13 18:06:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:00,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737929554] [2025-04-13 18:06:00,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:00,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 18:06:00,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:06:00,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:00,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:01,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737929554] [2025-04-13 18:06:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737929554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:01,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:01,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:06:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66660043] [2025-04-13 18:06:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:01,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:06:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:01,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:06:01,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:06:01,233 INFO L87 Difference]: Start difference. First operand 1986 states and 8493 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:01,710 INFO L93 Difference]: Finished difference Result 4982 states and 21342 transitions. [2025-04-13 18:06:01,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:06:01,711 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:06:01,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:01,749 INFO L225 Difference]: With dead ends: 4982 [2025-04-13 18:06:01,749 INFO L226 Difference]: Without dead ends: 1987 [2025-04-13 18:06:01,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:06:01,765 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:01,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-04-13 18:06:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1987. [2025-04-13 18:06:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1986 states have (on average 4.276938569989929) internal successors, (8494), 1986 states have internal predecessors, (8494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 8494 transitions. [2025-04-13 18:06:01,889 INFO L79 Accepts]: Start accepts. Automaton has 1987 states and 8494 transitions. Word has length 26 [2025-04-13 18:06:01,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:01,889 INFO L485 AbstractCegarLoop]: Abstraction has 1987 states and 8494 transitions. [2025-04-13 18:06:01,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:01,890 INFO L278 IsEmpty]: Start isEmpty. Operand 1987 states and 8494 transitions. [2025-04-13 18:06:01,896 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:06:01,896 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:01,896 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 18:06:01,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:06:01,897 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:01,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1454954584, now seen corresponding path program 1 times [2025-04-13 18:06:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:01,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978534374] [2025-04-13 18:06:01,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:01,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:06:01,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:06:01,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:01,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:02,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978534374] [2025-04-13 18:06:02,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978534374] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:02,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139045142] [2025-04-13 18:06:02,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:02,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:02,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:02,197 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 18:06:02,198 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 18:06:02,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:06:02,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:06:02,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:02,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:02,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:06:02,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:02,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:02,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139045142] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:02,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:02,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 18:06:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223817855] [2025-04-13 18:06:02,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:02,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:06:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:02,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:06:02,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:06:02,535 INFO L87 Difference]: Start difference. First operand 1987 states and 8494 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:03,275 INFO L93 Difference]: Finished difference Result 4984 states and 21343 transitions. [2025-04-13 18:06:03,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:06:03,276 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 18:06:03,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:03,329 INFO L225 Difference]: With dead ends: 4984 [2025-04-13 18:06:03,330 INFO L226 Difference]: Without dead ends: 2852 [2025-04-13 18:06:03,338 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:06:03,346 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:03,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 24 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-04-13 18:06:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2699. [2025-04-13 18:06:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2698 states have (on average 4.167160859896219) internal successors, (11243), 2698 states have internal predecessors, (11243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 11243 transitions. [2025-04-13 18:06:03,510 INFO L79 Accepts]: Start accepts. Automaton has 2699 states and 11243 transitions. Word has length 27 [2025-04-13 18:06:03,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:03,510 INFO L485 AbstractCegarLoop]: Abstraction has 2699 states and 11243 transitions. [2025-04-13 18:06:03,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:03,511 INFO L278 IsEmpty]: Start isEmpty. Operand 2699 states and 11243 transitions. [2025-04-13 18:06:03,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:06:03,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:03,520 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 18:06:03,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:03,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:03,725 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:03,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash -354100829, now seen corresponding path program 1 times [2025-04-13 18:06:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:03,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172053730] [2025-04-13 18:06:03,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:03,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:06:03,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:06:03,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:03,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:03,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172053730] [2025-04-13 18:06:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172053730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:03,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874161578] [2025-04-13 18:06:03,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:03,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:03,956 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 18:06:03,960 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 18:06:04,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:06:04,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:06:04,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:04,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:04,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:06:04,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:04,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874161578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:04,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 18:06:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193338978] [2025-04-13 18:06:04,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:04,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:06:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:04,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:06:04,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:06:04,553 INFO L87 Difference]: Start difference. First operand 2699 states and 11243 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:04,740 INFO L93 Difference]: Finished difference Result 3025 states and 12284 transitions. [2025-04-13 18:06:04,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:06:04,741 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 18:06:04,741 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:04,764 INFO L225 Difference]: With dead ends: 3025 [2025-04-13 18:06:04,764 INFO L226 Difference]: Without dead ends: 1988 [2025-04-13 18:06:04,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:06:04,768 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:04,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 20 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:06:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2025-04-13 18:06:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1988. [2025-04-13 18:06:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1987 states have (on average 4.275289380976346) internal successors, (8495), 1987 states have internal predecessors, (8495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 8495 transitions. [2025-04-13 18:06:04,857 INFO L79 Accepts]: Start accepts. Automaton has 1988 states and 8495 transitions. Word has length 27 [2025-04-13 18:06:04,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:04,858 INFO L485 AbstractCegarLoop]: Abstraction has 1988 states and 8495 transitions. [2025-04-13 18:06:04,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:04,861 INFO L278 IsEmpty]: Start isEmpty. Operand 1988 states and 8495 transitions. [2025-04-13 18:06:04,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:06:04,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:04,869 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 18:06:04,878 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 18:06:05,070 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,SelfDestructingSolverStorable3 [2025-04-13 18:06:05,070 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:05,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash -45888351, now seen corresponding path program 2 times [2025-04-13 18:06:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:05,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942964848] [2025-04-13 18:06:05,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:05,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:05,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:06:05,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:06:05,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:05,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:05,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942964848] [2025-04-13 18:06:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942964848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:06:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469017600] [2025-04-13 18:06:05,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:05,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:06:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:05,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:06:05,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:06:05,317 INFO L87 Difference]: Start difference. First operand 1988 states and 8495 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:05,899 INFO L93 Difference]: Finished difference Result 5038 states and 21767 transitions. [2025-04-13 18:06:05,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:06:05,899 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:06:05,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:05,942 INFO L225 Difference]: With dead ends: 5038 [2025-04-13 18:06:05,942 INFO L226 Difference]: Without dead ends: 4944 [2025-04-13 18:06:05,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 18:06:05,948 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:05,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2025-04-13 18:06:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4753. [2025-04-13 18:06:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4753 states, 4752 states have (on average 4.385311447811448) internal successors, (20839), 4752 states have internal predecessors, (20839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 20839 transitions. [2025-04-13 18:06:06,190 INFO L79 Accepts]: Start accepts. Automaton has 4753 states and 20839 transitions. Word has length 28 [2025-04-13 18:06:06,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:06,192 INFO L485 AbstractCegarLoop]: Abstraction has 4753 states and 20839 transitions. [2025-04-13 18:06:06,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:06,192 INFO L278 IsEmpty]: Start isEmpty. Operand 4753 states and 20839 transitions. [2025-04-13 18:06:06,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:06:06,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:06,211 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 18:06:06,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:06:06,212 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:06,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1054965404, now seen corresponding path program 2 times [2025-04-13 18:06:06,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:06,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185042139] [2025-04-13 18:06:06,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:06,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:06:06,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 18:06:06,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:06,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:06,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:06,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185042139] [2025-04-13 18:06:06,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185042139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:06,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:06,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:06:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096942176] [2025-04-13 18:06:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:06,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:06:06,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:06,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:06:06,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:06:06,370 INFO L87 Difference]: Start difference. First operand 4753 states and 20839 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:06,836 INFO L93 Difference]: Finished difference Result 6171 states and 26914 transitions. [2025-04-13 18:06:06,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:06:06,836 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:06:06,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:06,948 INFO L225 Difference]: With dead ends: 6171 [2025-04-13 18:06:06,948 INFO L226 Difference]: Without dead ends: 5987 [2025-04-13 18:06:06,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:06:06,955 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:06,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2025-04-13 18:06:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 5319. [2025-04-13 18:06:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5319 states, 5318 states have (on average 4.37457690861226) internal successors, (23264), 5318 states have internal predecessors, (23264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5319 states to 5319 states and 23264 transitions. [2025-04-13 18:06:07,306 INFO L79 Accepts]: Start accepts. Automaton has 5319 states and 23264 transitions. Word has length 28 [2025-04-13 18:06:07,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:07,308 INFO L485 AbstractCegarLoop]: Abstraction has 5319 states and 23264 transitions. [2025-04-13 18:06:07,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:07,308 INFO L278 IsEmpty]: Start isEmpty. Operand 5319 states and 23264 transitions. [2025-04-13 18:06:07,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:07,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:07,329 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, 1, 1, 1] [2025-04-13 18:06:07,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:06:07,329 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:07,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1249818104, now seen corresponding path program 1 times [2025-04-13 18:06:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:07,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281132821] [2025-04-13 18:06:07,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:07,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:07,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:07,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:07,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:08,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281132821] [2025-04-13 18:06:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281132821] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:08,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756862490] [2025-04-13 18:06:08,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:08,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:08,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:08,515 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 18:06:08,523 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 18:06:08,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:08,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:08,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:08,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:06:08,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:09,392 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:09,393 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 21 treesize of output 15 [2025-04-13 18:06:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:09,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756862490] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:09,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 20 [2025-04-13 18:06:09,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615521419] [2025-04-13 18:06:09,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:09,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:06:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:09,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:06:09,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:06:09,747 INFO L87 Difference]: Start difference. First operand 5319 states and 23264 transitions. Second operand has 21 states, 20 states have (on average 4.55) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:13,134 INFO L93 Difference]: Finished difference Result 12443 states and 54201 transitions. [2025-04-13 18:06:13,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:06:13,134 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 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 18:06:13,135 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:13,302 INFO L225 Difference]: With dead ends: 12443 [2025-04-13 18:06:13,302 INFO L226 Difference]: Without dead ends: 12406 [2025-04-13 18:06:13,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:06:13,315 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 634 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:13,316 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 273 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:06:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12406 states. [2025-04-13 18:06:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12406 to 5754. [2025-04-13 18:06:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5754 states, 5753 states have (on average 4.380323309577611) internal successors, (25200), 5753 states have internal predecessors, (25200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 25200 transitions. [2025-04-13 18:06:13,983 INFO L79 Accepts]: Start accepts. Automaton has 5754 states and 25200 transitions. Word has length 31 [2025-04-13 18:06:13,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:13,983 INFO L485 AbstractCegarLoop]: Abstraction has 5754 states and 25200 transitions. [2025-04-13 18:06:13,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:13,984 INFO L278 IsEmpty]: Start isEmpty. Operand 5754 states and 25200 transitions. [2025-04-13 18:06:14,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:14,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:14,002 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, 1, 1, 1] [2025-04-13 18:06:14,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:14,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:14,203 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:14,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1983886605, now seen corresponding path program 1 times [2025-04-13 18:06:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:14,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122112559] [2025-04-13 18:06:14,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:14,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:14,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:15,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:15,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122112559] [2025-04-13 18:06:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122112559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:15,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814924198] [2025-04-13 18:06:15,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:15,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:15,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:15,211 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 18:06:15,213 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 18:06:15,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:15,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:15,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:15,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:15,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:06:15,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:15,768 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:15,768 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 21 treesize of output 15 [2025-04-13 18:06:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:15,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814924198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:16,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2025-04-13 18:06:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449997418] [2025-04-13 18:06:16,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:16,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:06:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:06:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:06:16,008 INFO L87 Difference]: Start difference. First operand 5754 states and 25200 transitions. Second operand has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:18,592 INFO L93 Difference]: Finished difference Result 12606 states and 54983 transitions. [2025-04-13 18:06:18,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:06:18,592 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 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 18:06:18,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:18,741 INFO L225 Difference]: With dead ends: 12606 [2025-04-13 18:06:18,741 INFO L226 Difference]: Without dead ends: 12569 [2025-04-13 18:06:18,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:06:18,758 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 803 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:18,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 242 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:06:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12569 states. [2025-04-13 18:06:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12569 to 6354. [2025-04-13 18:06:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6354 states, 6353 states have (on average 4.407366598457422) internal successors, (28000), 6353 states have internal predecessors, (28000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 28000 transitions. [2025-04-13 18:06:19,517 INFO L79 Accepts]: Start accepts. Automaton has 6354 states and 28000 transitions. Word has length 31 [2025-04-13 18:06:19,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:19,517 INFO L485 AbstractCegarLoop]: Abstraction has 6354 states and 28000 transitions. [2025-04-13 18:06:19,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:19,517 INFO L278 IsEmpty]: Start isEmpty. Operand 6354 states and 28000 transitions. [2025-04-13 18:06:19,565 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:19,565 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:19,565 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, 1, 1, 1] [2025-04-13 18:06:19,582 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 18:06:19,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:19,771 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:19,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1053214664, now seen corresponding path program 2 times [2025-04-13 18:06:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:19,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490278577] [2025-04-13 18:06:19,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:19,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:19,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:06:19,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:19,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:20,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:20,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490278577] [2025-04-13 18:06:20,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490278577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:20,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:20,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:06:20,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645677825] [2025-04-13 18:06:20,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:20,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:06:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:20,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:06:20,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:06:20,393 INFO L87 Difference]: Start difference. First operand 6354 states and 28000 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:06:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:21,690 INFO L93 Difference]: Finished difference Result 8292 states and 36496 transitions. [2025-04-13 18:06:21,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:21,691 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:06:21,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:21,768 INFO L225 Difference]: With dead ends: 8292 [2025-04-13 18:06:21,769 INFO L226 Difference]: Without dead ends: 8267 [2025-04-13 18:06:21,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:06:21,774 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:21,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 47 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:06:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2025-04-13 18:06:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 6402. [2025-04-13 18:06:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6401 states have (on average 4.4080612404311825) internal successors, (28216), 6401 states have internal predecessors, (28216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 28216 transitions. [2025-04-13 18:06:22,310 INFO L79 Accepts]: Start accepts. Automaton has 6402 states and 28216 transitions. Word has length 31 [2025-04-13 18:06:22,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:22,311 INFO L485 AbstractCegarLoop]: Abstraction has 6402 states and 28216 transitions. [2025-04-13 18:06:22,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:06:22,311 INFO L278 IsEmpty]: Start isEmpty. Operand 6402 states and 28216 transitions. [2025-04-13 18:06:22,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:22,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:22,348 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, 1, 1, 1] [2025-04-13 18:06:22,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:06:22,348 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:22,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -522535448, now seen corresponding path program 3 times [2025-04-13 18:06:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:22,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741030469] [2025-04-13 18:06:22,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:22,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:22,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:06:22,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:22,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:22,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:22,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741030469] [2025-04-13 18:06:22,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741030469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:22,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:22,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:06:22,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733377977] [2025-04-13 18:06:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:22,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:06:22,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:22,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:06:22,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:06:22,763 INFO L87 Difference]: Start difference. First operand 6402 states and 28216 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:06:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:23,723 INFO L93 Difference]: Finished difference Result 8356 states and 36763 transitions. [2025-04-13 18:06:23,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:23,726 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:06:23,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:23,777 INFO L225 Difference]: With dead ends: 8356 [2025-04-13 18:06:23,777 INFO L226 Difference]: Without dead ends: 8337 [2025-04-13 18:06:23,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:06:23,784 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:23,784 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 39 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8337 states. [2025-04-13 18:06:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8337 to 6402. [2025-04-13 18:06:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6401 states have (on average 4.4080612404311825) internal successors, (28216), 6401 states have internal predecessors, (28216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 28216 transitions. [2025-04-13 18:06:24,539 INFO L79 Accepts]: Start accepts. Automaton has 6402 states and 28216 transitions. Word has length 31 [2025-04-13 18:06:24,539 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:24,539 INFO L485 AbstractCegarLoop]: Abstraction has 6402 states and 28216 transitions. [2025-04-13 18:06:24,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:06:24,540 INFO L278 IsEmpty]: Start isEmpty. Operand 6402 states and 28216 transitions. [2025-04-13 18:06:24,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:24,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:24,563 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, 1, 1, 1] [2025-04-13 18:06:24,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:06:24,563 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:24,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1123791861, now seen corresponding path program 2 times [2025-04-13 18:06:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:24,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488774596] [2025-04-13 18:06:24,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:24,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:24,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:24,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:24,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:24,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488774596] [2025-04-13 18:06:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488774596] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:24,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092582804] [2025-04-13 18:06:24,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:24,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:24,851 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 18:06:24,853 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 18:06:24,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:24,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:24,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:24,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:24,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:06:24,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:25,265 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 15 treesize of output 7 [2025-04-13 18:06:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:25,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092582804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:25,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:25,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 19 [2025-04-13 18:06:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772499824] [2025-04-13 18:06:25,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:25,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:06:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:25,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:06:25,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:06:25,623 INFO L87 Difference]: Start difference. First operand 6402 states and 28216 transitions. Second operand has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:28,469 INFO L93 Difference]: Finished difference Result 17951 states and 78621 transitions. [2025-04-13 18:06:28,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:28,470 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 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 18:06:28,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:28,554 INFO L225 Difference]: With dead ends: 17951 [2025-04-13 18:06:28,555 INFO L226 Difference]: Without dead ends: 13783 [2025-04-13 18:06:28,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:28,587 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 560 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:28,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 189 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:06:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13783 states. [2025-04-13 18:06:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13783 to 7998. [2025-04-13 18:06:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7998 states, 7997 states have (on average 4.454545454545454) internal successors, (35623), 7997 states have internal predecessors, (35623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 35623 transitions. [2025-04-13 18:06:29,331 INFO L79 Accepts]: Start accepts. Automaton has 7998 states and 35623 transitions. Word has length 31 [2025-04-13 18:06:29,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:29,331 INFO L485 AbstractCegarLoop]: Abstraction has 7998 states and 35623 transitions. [2025-04-13 18:06:29,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:29,331 INFO L278 IsEmpty]: Start isEmpty. Operand 7998 states and 35623 transitions. [2025-04-13 18:06:29,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:29,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:29,354 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, 1, 1, 1] [2025-04-13 18:06:29,363 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 18:06:29,555 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,SelfDestructingSolverStorable10 [2025-04-13 18:06:29,555 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:29,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2017707401, now seen corresponding path program 3 times [2025-04-13 18:06:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:29,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243133183] [2025-04-13 18:06:29,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:29,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:29,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:06:29,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:29,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:29,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243133183] [2025-04-13 18:06:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243133183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:06:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293225089] [2025-04-13 18:06:29,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:29,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:06:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:29,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:06:29,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:06:29,709 INFO L87 Difference]: Start difference. First operand 7998 states and 35623 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:06:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:30,828 INFO L93 Difference]: Finished difference Result 10049 states and 44547 transitions. [2025-04-13 18:06:30,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:30,829 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:06:30,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:30,885 INFO L225 Difference]: With dead ends: 10049 [2025-04-13 18:06:30,885 INFO L226 Difference]: Without dead ends: 10030 [2025-04-13 18:06:30,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:06:30,892 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:30,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 41 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10030 states. [2025-04-13 18:06:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10030 to 7998. [2025-04-13 18:06:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7998 states, 7997 states have (on average 4.454545454545454) internal successors, (35623), 7997 states have internal predecessors, (35623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 35623 transitions. [2025-04-13 18:06:31,659 INFO L79 Accepts]: Start accepts. Automaton has 7998 states and 35623 transitions. Word has length 31 [2025-04-13 18:06:31,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:31,659 INFO L485 AbstractCegarLoop]: Abstraction has 7998 states and 35623 transitions. [2025-04-13 18:06:31,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:06:31,659 INFO L278 IsEmpty]: Start isEmpty. Operand 7998 states and 35623 transitions. [2025-04-13 18:06:31,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:31,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:31,680 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, 1, 1, 1] [2025-04-13 18:06:31,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:06:31,680 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:31,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash 812796954, now seen corresponding path program 4 times [2025-04-13 18:06:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:31,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329393579] [2025-04-13 18:06:31,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:31,689 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:31,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:31,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:06:31,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:31,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329393579] [2025-04-13 18:06:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329393579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:31,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:06:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547313222] [2025-04-13 18:06:31,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:31,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:06:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:31,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:06:31,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:06:31,881 INFO L87 Difference]: Start difference. First operand 7998 states and 35623 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:06:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:33,116 INFO L93 Difference]: Finished difference Result 10941 states and 48625 transitions. [2025-04-13 18:06:33,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:33,117 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:06:33,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:33,166 INFO L225 Difference]: With dead ends: 10941 [2025-04-13 18:06:33,166 INFO L226 Difference]: Without dead ends: 10934 [2025-04-13 18:06:33,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:06:33,171 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:33,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 49 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2025-04-13 18:06:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 8196. [2025-04-13 18:06:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8196 states, 8195 states have (on average 4.461012812690665) internal successors, (36558), 8195 states have internal predecessors, (36558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 36558 transitions. [2025-04-13 18:06:33,782 INFO L79 Accepts]: Start accepts. Automaton has 8196 states and 36558 transitions. Word has length 31 [2025-04-13 18:06:33,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:33,782 INFO L485 AbstractCegarLoop]: Abstraction has 8196 states and 36558 transitions. [2025-04-13 18:06:33,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:06:33,782 INFO L278 IsEmpty]: Start isEmpty. Operand 8196 states and 36558 transitions. [2025-04-13 18:06:33,801 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:33,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:33,801 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, 1, 1, 1] [2025-04-13 18:06:33,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:06:33,801 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:33,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash 549026174, now seen corresponding path program 5 times [2025-04-13 18:06:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:33,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204807805] [2025-04-13 18:06:33,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:33,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:33,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:33,823 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:33,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:34,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204807805] [2025-04-13 18:06:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204807805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:34,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621883490] [2025-04-13 18:06:34,380 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:34,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:34,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:34,383 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 18:06:34,384 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 18:06:34,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:34,462 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:34,463 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:34,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:34,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:06:34,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:34,584 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 19 treesize of output 7 [2025-04-13 18:06:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:34,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621883490] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:34,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:34,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 18:06:34,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425547767] [2025-04-13 18:06:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:34,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:06:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:34,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:06:34,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:06:34,784 INFO L87 Difference]: Start difference. First operand 8196 states and 36558 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:06:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:35,771 INFO L93 Difference]: Finished difference Result 9040 states and 40241 transitions. [2025-04-13 18:06:35,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:35,772 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 31 [2025-04-13 18:06:35,772 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:35,824 INFO L225 Difference]: With dead ends: 9040 [2025-04-13 18:06:35,824 INFO L226 Difference]: Without dead ends: 9033 [2025-04-13 18:06:35,828 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:06:35,828 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:35,829 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 39 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9033 states. [2025-04-13 18:06:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9033 to 8358. [2025-04-13 18:06:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8358 states, 8357 states have (on average 4.474691875074788) internal successors, (37395), 8357 states have internal predecessors, (37395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 37395 transitions. [2025-04-13 18:06:36,549 INFO L79 Accepts]: Start accepts. Automaton has 8358 states and 37395 transitions. Word has length 31 [2025-04-13 18:06:36,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:36,550 INFO L485 AbstractCegarLoop]: Abstraction has 8358 states and 37395 transitions. [2025-04-13 18:06:36,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:06:36,550 INFO L278 IsEmpty]: Start isEmpty. Operand 8358 states and 37395 transitions. [2025-04-13 18:06:36,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:36,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:36,572 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, 1, 1, 1] [2025-04-13 18:06:36,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:36,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:36,776 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:36,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -140143778, now seen corresponding path program 6 times [2025-04-13 18:06:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:36,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252107167] [2025-04-13 18:06:36,777 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:36,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:36,787 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:36,800 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:06:36,801 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:36,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:36,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252107167] [2025-04-13 18:06:36,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252107167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:36,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:36,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:06:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930461505] [2025-04-13 18:06:36,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:36,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:06:36,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:36,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:06:36,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:06:36,940 INFO L87 Difference]: Start difference. First operand 8358 states and 37395 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:06:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:38,187 INFO L93 Difference]: Finished difference Result 10296 states and 45876 transitions. [2025-04-13 18:06:38,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:38,188 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:06:38,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:38,232 INFO L225 Difference]: With dead ends: 10296 [2025-04-13 18:06:38,232 INFO L226 Difference]: Without dead ends: 10289 [2025-04-13 18:06:38,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:06:38,240 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:38,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 47 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10289 states. [2025-04-13 18:06:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10289 to 8412. [2025-04-13 18:06:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8412 states, 8411 states have (on average 4.476281060515991) internal successors, (37650), 8411 states have internal predecessors, (37650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8412 states to 8412 states and 37650 transitions. [2025-04-13 18:06:38,853 INFO L79 Accepts]: Start accepts. Automaton has 8412 states and 37650 transitions. Word has length 31 [2025-04-13 18:06:38,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:38,853 INFO L485 AbstractCegarLoop]: Abstraction has 8412 states and 37650 transitions. [2025-04-13 18:06:38,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:06:38,853 INFO L278 IsEmpty]: Start isEmpty. Operand 8412 states and 37650 transitions. [2025-04-13 18:06:38,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:38,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:38,867 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, 1, 1, 1] [2025-04-13 18:06:38,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:06:38,868 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:38,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2115856257, now seen corresponding path program 4 times [2025-04-13 18:06:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:38,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735748217] [2025-04-13 18:06:38,868 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:38,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:38,880 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:38,880 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:06:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:38,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735748217] [2025-04-13 18:06:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735748217] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:38,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826709006] [2025-04-13 18:06:38,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:38,976 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 18:06:38,977 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 18:06:39,033 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:39,060 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:39,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:06:39,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:39,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 18:06:39,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:39,080 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 19 treesize of output 1 [2025-04-13 18:06:39,172 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:39,172 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 21 treesize of output 15 [2025-04-13 18:06:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:39,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:39,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826709006] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:39,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:39,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 15 [2025-04-13 18:06:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792460852] [2025-04-13 18:06:39,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:39,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:06:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:39,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:06:39,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:06:39,281 INFO L87 Difference]: Start difference. First operand 8412 states and 37650 transitions. Second operand has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:41,082 INFO L93 Difference]: Finished difference Result 14657 states and 64828 transitions. [2025-04-13 18:06:41,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:06:41,082 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 18:06:41,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:41,132 INFO L225 Difference]: With dead ends: 14657 [2025-04-13 18:06:41,133 INFO L226 Difference]: Without dead ends: 14644 [2025-04-13 18:06:41,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:06:41,138 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 362 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:41,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 182 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14644 states. [2025-04-13 18:06:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14644 to 8904. [2025-04-13 18:06:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8904 states, 8903 states have (on average 4.504773671796023) internal successors, (40106), 8903 states have internal predecessors, (40106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8904 states to 8904 states and 40106 transitions. [2025-04-13 18:06:41,907 INFO L79 Accepts]: Start accepts. Automaton has 8904 states and 40106 transitions. Word has length 31 [2025-04-13 18:06:41,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:41,908 INFO L485 AbstractCegarLoop]: Abstraction has 8904 states and 40106 transitions. [2025-04-13 18:06:41,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:41,908 INFO L278 IsEmpty]: Start isEmpty. Operand 8904 states and 40106 transitions. [2025-04-13 18:06:41,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:41,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:41,923 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, 1, 1, 1] [2025-04-13 18:06:41,929 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 18:06:42,125 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 18:06:42,125 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:42,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -121355337, now seen corresponding path program 5 times [2025-04-13 18:06:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:42,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812205329] [2025-04-13 18:06:42,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:42,132 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:42,138 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:42,138 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:42,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:42,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:42,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812205329] [2025-04-13 18:06:42,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812205329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:42,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905568423] [2025-04-13 18:06:42,425 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:42,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:42,427 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 18:06:42,430 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 18:06:42,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:42,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:42,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:42,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:42,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:06:42,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:42,633 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 19 treesize of output 7 [2025-04-13 18:06:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:42,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:42,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905568423] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:42,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:42,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 18:06:42,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074961070] [2025-04-13 18:06:42,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:42,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:06:42,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:42,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:06:42,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:06:42,789 INFO L87 Difference]: Start difference. First operand 8904 states and 40106 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:06:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:44,031 INFO L93 Difference]: Finished difference Result 9906 states and 44426 transitions. [2025-04-13 18:06:44,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:44,031 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 31 [2025-04-13 18:06:44,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:44,067 INFO L225 Difference]: With dead ends: 9906 [2025-04-13 18:06:44,067 INFO L226 Difference]: Without dead ends: 9899 [2025-04-13 18:06:44,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:06:44,071 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:44,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 39 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:06:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2025-04-13 18:06:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 9144. [2025-04-13 18:06:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9144 states, 9143 states have (on average 4.5171169200481245) internal successors, (41300), 9143 states have internal predecessors, (41300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9144 states to 9144 states and 41300 transitions. [2025-04-13 18:06:44,830 INFO L79 Accepts]: Start accepts. Automaton has 9144 states and 41300 transitions. Word has length 31 [2025-04-13 18:06:44,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:44,830 INFO L485 AbstractCegarLoop]: Abstraction has 9144 states and 41300 transitions. [2025-04-13 18:06:44,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:06:44,830 INFO L278 IsEmpty]: Start isEmpty. Operand 9144 states and 41300 transitions. [2025-04-13 18:06:44,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:44,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:44,847 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, 1, 1, 1] [2025-04-13 18:06:44,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:45,047 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 18:06:45,047 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:45,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1576682781, now seen corresponding path program 6 times [2025-04-13 18:06:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:45,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333349169] [2025-04-13 18:06:45,048 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:45,053 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:06:45,058 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:06:45,058 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:45,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:45,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333349169] [2025-04-13 18:06:45,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333349169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:45,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:45,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:06:45,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075082905] [2025-04-13 18:06:45,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:45,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:06:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:45,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:06:45,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:06:45,154 INFO L87 Difference]: Start difference. First operand 9144 states and 41300 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:06:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:46,352 INFO L93 Difference]: Finished difference Result 11141 states and 49963 transitions. [2025-04-13 18:06:46,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:06:46,352 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:06:46,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:46,391 INFO L225 Difference]: With dead ends: 11141 [2025-04-13 18:06:46,391 INFO L226 Difference]: Without dead ends: 11134 [2025-04-13 18:06:46,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:06:46,396 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:46,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 41 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2025-04-13 18:06:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 9214. [2025-04-13 18:06:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 9213 states have (on average 4.517855204602193) internal successors, (41623), 9213 states have internal predecessors, (41623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 41623 transitions. [2025-04-13 18:06:47,191 INFO L79 Accepts]: Start accepts. Automaton has 9214 states and 41623 transitions. Word has length 31 [2025-04-13 18:06:47,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:47,191 INFO L485 AbstractCegarLoop]: Abstraction has 9214 states and 41623 transitions. [2025-04-13 18:06:47,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:06:47,191 INFO L278 IsEmpty]: Start isEmpty. Operand 9214 states and 41623 transitions. [2025-04-13 18:06:47,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:47,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:47,212 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, 1, 1, 1] [2025-04-13 18:06:47,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:06:47,212 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:47,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -155306553, now seen corresponding path program 1 times [2025-04-13 18:06:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:47,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363520740] [2025-04-13 18:06:47,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:47,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:47,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:47,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:47,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:47,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363520740] [2025-04-13 18:06:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363520740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:47,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920649456] [2025-04-13 18:06:47,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:47,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:47,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:47,440 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 18:06:47,441 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 18:06:47,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:47,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:47,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:47,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:47,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:06:47,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:47,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:47,647 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 21 treesize of output 15 [2025-04-13 18:06:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:47,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:47,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920649456] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:47,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:47,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2025-04-13 18:06:47,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921309840] [2025-04-13 18:06:47,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:47,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:06:47,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:47,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:06:47,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:06:47,789 INFO L87 Difference]: Start difference. First operand 9214 states and 41623 transitions. Second operand has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:50,126 INFO L93 Difference]: Finished difference Result 15109 states and 67477 transitions. [2025-04-13 18:06:50,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:06:50,127 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 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 18:06:50,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:50,203 INFO L225 Difference]: With dead ends: 15109 [2025-04-13 18:06:50,203 INFO L226 Difference]: Without dead ends: 15074 [2025-04-13 18:06:50,214 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:06:50,214 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 402 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:50,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 199 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15074 states. [2025-04-13 18:06:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15074 to 9827. [2025-04-13 18:06:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9827 states, 9826 states have (on average 4.531854264197028) internal successors, (44530), 9826 states have internal predecessors, (44530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44530 transitions. [2025-04-13 18:06:51,583 INFO L79 Accepts]: Start accepts. Automaton has 9827 states and 44530 transitions. Word has length 31 [2025-04-13 18:06:51,583 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:51,583 INFO L485 AbstractCegarLoop]: Abstraction has 9827 states and 44530 transitions. [2025-04-13 18:06:51,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:51,583 INFO L278 IsEmpty]: Start isEmpty. Operand 9827 states and 44530 transitions. [2025-04-13 18:06:51,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:06:51,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:51,645 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, 1, 1, 1] [2025-04-13 18:06:51,658 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 18:06:51,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:51,850 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:06:51,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1216569140, now seen corresponding path program 1 times [2025-04-13 18:06:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:51,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404121574] [2025-04-13 18:06:51,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:51,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:51,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:51,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:51,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:52,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404121574] [2025-04-13 18:06:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404121574] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:52,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996942079] [2025-04-13 18:06:52,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:06:52,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:52,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:52,381 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 18:06:52,383 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 18:06:52,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:06:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:06:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:52,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:06:52,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:52,817 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:52,818 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 21 treesize of output 15 [2025-04-13 18:06:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:06:52,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996942079] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:06:53,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:06:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2025-04-13 18:06:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055065117] [2025-04-13 18:06:53,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:06:53,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:06:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:53,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:06:53,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:06:53,009 INFO L87 Difference]: Start difference. First operand 9827 states and 44530 transitions. Second operand has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:00,580 INFO L93 Difference]: Finished difference Result 33375 states and 147484 transitions. [2025-04-13 18:07:00,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:07:00,581 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 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 18:07:00,581 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:00,732 INFO L225 Difference]: With dead ends: 33375 [2025-04-13 18:07:00,732 INFO L226 Difference]: Without dead ends: 33201 [2025-04-13 18:07:00,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=473, Invalid=1977, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:07:00,743 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 608 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:00,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 367 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:07:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33201 states. [2025-04-13 18:07:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33201 to 15492. [2025-04-13 18:07:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15492 states, 15491 states have (on average 4.655606481182622) internal successors, (72120), 15491 states have internal predecessors, (72120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15492 states to 15492 states and 72120 transitions. [2025-04-13 18:07:02,856 INFO L79 Accepts]: Start accepts. Automaton has 15492 states and 72120 transitions. Word has length 31 [2025-04-13 18:07:02,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:02,856 INFO L485 AbstractCegarLoop]: Abstraction has 15492 states and 72120 transitions. [2025-04-13 18:07:02,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 20 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:02,856 INFO L278 IsEmpty]: Start isEmpty. Operand 15492 states and 72120 transitions. [2025-04-13 18:07:02,903 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:02,903 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:02,903 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, 1, 1, 1] [2025-04-13 18:07:02,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:03,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:03,111 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:03,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1593106101, now seen corresponding path program 2 times [2025-04-13 18:07:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:03,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325741390] [2025-04-13 18:07:03,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:03,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:03,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:07:03,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:03,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:03,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:03,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325741390] [2025-04-13 18:07:03,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325741390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:03,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:03,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:03,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946688339] [2025-04-13 18:07:03,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:03,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:03,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:03,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:03,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:03,322 INFO L87 Difference]: Start difference. First operand 15492 states and 72120 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:07:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:07,652 INFO L93 Difference]: Finished difference Result 17455 states and 80747 transitions. [2025-04-13 18:07:07,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:07:07,652 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:07:07,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:07,771 INFO L225 Difference]: With dead ends: 17455 [2025-04-13 18:07:07,772 INFO L226 Difference]: Without dead ends: 17430 [2025-04-13 18:07:07,782 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:07,783 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 64 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:07,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 39 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17430 states. [2025-04-13 18:07:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17430 to 15555. [2025-04-13 18:07:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15555 states, 15554 states have (on average 4.655586987270156) internal successors, (72413), 15554 states have internal predecessors, (72413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15555 states to 15555 states and 72413 transitions. [2025-04-13 18:07:10,649 INFO L79 Accepts]: Start accepts. Automaton has 15555 states and 72413 transitions. Word has length 31 [2025-04-13 18:07:10,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:10,649 INFO L485 AbstractCegarLoop]: Abstraction has 15555 states and 72413 transitions. [2025-04-13 18:07:10,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:07:10,649 INFO L278 IsEmpty]: Start isEmpty. Operand 15555 states and 72413 transitions. [2025-04-13 18:07:10,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:10,699 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:10,699 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, 1, 1, 1] [2025-04-13 18:07:10,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:07:10,699 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:10,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1080454695, now seen corresponding path program 3 times [2025-04-13 18:07:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:10,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329332315] [2025-04-13 18:07:10,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:10,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:10,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:10,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:07:10,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:10,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:10,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329332315] [2025-04-13 18:07:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329332315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:10,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:10,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940526829] [2025-04-13 18:07:10,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:10,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:10,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:10,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:10,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:10,941 INFO L87 Difference]: Start difference. First operand 15555 states and 72413 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:07:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:15,504 INFO L93 Difference]: Finished difference Result 17795 states and 82471 transitions. [2025-04-13 18:07:15,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:07:15,504 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:07:15,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:15,623 INFO L225 Difference]: With dead ends: 17795 [2025-04-13 18:07:15,624 INFO L226 Difference]: Without dead ends: 17777 [2025-04-13 18:07:15,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:15,637 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:15,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 41 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17777 states. [2025-04-13 18:07:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17777 to 15555. [2025-04-13 18:07:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15555 states, 15554 states have (on average 4.655586987270156) internal successors, (72413), 15554 states have internal predecessors, (72413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15555 states to 15555 states and 72413 transitions. [2025-04-13 18:07:18,526 INFO L79 Accepts]: Start accepts. Automaton has 15555 states and 72413 transitions. Word has length 31 [2025-04-13 18:07:18,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:18,526 INFO L485 AbstractCegarLoop]: Abstraction has 15555 states and 72413 transitions. [2025-04-13 18:07:18,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:07:18,526 INFO L278 IsEmpty]: Start isEmpty. Operand 15555 states and 72413 transitions. [2025-04-13 18:07:18,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:18,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:18,574 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, 1, 1, 1] [2025-04-13 18:07:18,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:07:18,578 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:18,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1272407664, now seen corresponding path program 2 times [2025-04-13 18:07:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:18,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666998382] [2025-04-13 18:07:18,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:18,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:18,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:07:18,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:18,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:18,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666998382] [2025-04-13 18:07:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666998382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:18,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901856208] [2025-04-13 18:07:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:18,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:18,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:18,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:18,701 INFO L87 Difference]: Start difference. First operand 15555 states and 72413 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:07:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:23,102 INFO L93 Difference]: Finished difference Result 17659 states and 81647 transitions. [2025-04-13 18:07:23,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:07:23,103 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:07:23,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:23,222 INFO L225 Difference]: With dead ends: 17659 [2025-04-13 18:07:23,223 INFO L226 Difference]: Without dead ends: 17634 [2025-04-13 18:07:23,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:23,237 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:23,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 43 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17634 states. [2025-04-13 18:07:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17634 to 15680. [2025-04-13 18:07:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15680 states, 15679 states have (on average 4.651763505325595) internal successors, (72935), 15679 states have internal predecessors, (72935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15680 states to 15680 states and 72935 transitions. [2025-04-13 18:07:26,828 INFO L79 Accepts]: Start accepts. Automaton has 15680 states and 72935 transitions. Word has length 31 [2025-04-13 18:07:26,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:26,828 INFO L485 AbstractCegarLoop]: Abstraction has 15680 states and 72935 transitions. [2025-04-13 18:07:26,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:07:26,828 INFO L278 IsEmpty]: Start isEmpty. Operand 15680 states and 72935 transitions. [2025-04-13 18:07:26,878 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:26,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:26,883 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, 1, 1, 1] [2025-04-13 18:07:26,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:07:26,883 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:26,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash -302693382, now seen corresponding path program 3 times [2025-04-13 18:07:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:26,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542222710] [2025-04-13 18:07:26,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:26,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:26,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:07:26,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:26,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:27,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542222710] [2025-04-13 18:07:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542222710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923940820] [2025-04-13 18:07:27,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:27,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:27,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:27,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:27,027 INFO L87 Difference]: Start difference. First operand 15680 states and 72935 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:07:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:31,368 INFO L93 Difference]: Finished difference Result 18009 states and 83451 transitions. [2025-04-13 18:07:31,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:07:31,368 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:07:31,368 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:31,458 INFO L225 Difference]: With dead ends: 18009 [2025-04-13 18:07:31,458 INFO L226 Difference]: Without dead ends: 17991 [2025-04-13 18:07:31,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:31,464 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:31,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 39 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17991 states. [2025-04-13 18:07:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17991 to 15720. [2025-04-13 18:07:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15720 states, 15719 states have (on average 4.654240091608881) internal successors, (73160), 15719 states have internal predecessors, (73160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15720 states to 15720 states and 73160 transitions. [2025-04-13 18:07:33,701 INFO L79 Accepts]: Start accepts. Automaton has 15720 states and 73160 transitions. Word has length 31 [2025-04-13 18:07:33,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:33,701 INFO L485 AbstractCegarLoop]: Abstraction has 15720 states and 73160 transitions. [2025-04-13 18:07:33,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:07:33,701 INFO L278 IsEmpty]: Start isEmpty. Operand 15720 states and 73160 transitions. [2025-04-13 18:07:33,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:33,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:33,746 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, 1, 1, 1] [2025-04-13 18:07:33,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:07:33,746 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:33,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2133590967, now seen corresponding path program 4 times [2025-04-13 18:07:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:33,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271716307] [2025-04-13 18:07:33,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:33,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:33,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:07:33,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:33,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:34,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271716307] [2025-04-13 18:07:34,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271716307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:34,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459371619] [2025-04-13 18:07:34,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:34,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:34,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:34,209 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 18:07:34,210 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 18:07:34,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:34,295 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:07:34,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:34,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:34,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 18:07:34,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:34,321 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 19 treesize of output 1 [2025-04-13 18:07:34,437 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 19 treesize of output 7 [2025-04-13 18:07:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:34,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459371619] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 20 [2025-04-13 18:07:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117058474] [2025-04-13 18:07:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:34,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:07:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:34,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:07:34,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:07:34,591 INFO L87 Difference]: Start difference. First operand 15720 states and 73160 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:07:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:37,910 INFO L93 Difference]: Finished difference Result 18650 states and 86320 transitions. [2025-04-13 18:07:37,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:07:37,911 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 31 [2025-04-13 18:07:37,911 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:37,985 INFO L225 Difference]: With dead ends: 18650 [2025-04-13 18:07:37,985 INFO L226 Difference]: Without dead ends: 18643 [2025-04-13 18:07:37,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:07:37,990 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 90 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:37,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 47 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18643 states. [2025-04-13 18:07:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18643 to 16166. [2025-04-13 18:07:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16166 states, 16165 states have (on average 4.657902876585215) internal successors, (75295), 16165 states have internal predecessors, (75295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16166 states to 16166 states and 75295 transitions. [2025-04-13 18:07:39,951 INFO L79 Accepts]: Start accepts. Automaton has 16166 states and 75295 transitions. Word has length 31 [2025-04-13 18:07:39,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:39,952 INFO L485 AbstractCegarLoop]: Abstraction has 16166 states and 75295 transitions. [2025-04-13 18:07:39,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:07:39,952 INFO L278 IsEmpty]: Start isEmpty. Operand 16166 states and 75295 transitions. [2025-04-13 18:07:39,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:39,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:39,984 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, 1, 1, 1] [2025-04-13 18:07:39,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 18:07:40,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 18:07:40,185 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:40,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash -797165989, now seen corresponding path program 5 times [2025-04-13 18:07:40,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:40,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538732383] [2025-04-13 18:07:40,185 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:40,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:40,190 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:40,196 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:07:40,196 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:40,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:40,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538732383] [2025-04-13 18:07:40,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538732383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:40,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435433790] [2025-04-13 18:07:40,561 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:40,563 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 18:07:40,563 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 18:07:40,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:40,636 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:07:40,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:40,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:40,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:07:40,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:40,739 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 19 treesize of output 7 [2025-04-13 18:07:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:07:40,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435433790] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:40,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 18:07:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091072134] [2025-04-13 18:07:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:40,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:07:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:40,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:07:40,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:07:40,927 INFO L87 Difference]: Start difference. First operand 16166 states and 75295 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:07:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:44,372 INFO L93 Difference]: Finished difference Result 16983 states and 78895 transitions. [2025-04-13 18:07:44,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:07:44,372 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 31 [2025-04-13 18:07:44,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:44,476 INFO L225 Difference]: With dead ends: 16983 [2025-04-13 18:07:44,477 INFO L226 Difference]: Without dead ends: 16976 [2025-04-13 18:07:44,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:07:44,483 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:44,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 43 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16976 states. [2025-04-13 18:07:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16976 to 16390. [2025-04-13 18:07:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16390 states, 16389 states have (on average 4.662883641466838) internal successors, (76420), 16389 states have internal predecessors, (76420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16390 states to 16390 states and 76420 transitions. [2025-04-13 18:07:47,032 INFO L79 Accepts]: Start accepts. Automaton has 16390 states and 76420 transitions. Word has length 31 [2025-04-13 18:07:47,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:47,033 INFO L485 AbstractCegarLoop]: Abstraction has 16390 states and 76420 transitions. [2025-04-13 18:07:47,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:07:47,033 INFO L278 IsEmpty]: Start isEmpty. Operand 16390 states and 76420 transitions. [2025-04-13 18:07:47,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:47,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:47,071 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, 1, 1, 1] [2025-04-13 18:07:47,077 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 18:07:47,271 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,SelfDestructingSolverStorable25 [2025-04-13 18:07:47,271 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:47,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1531992329, now seen corresponding path program 6 times [2025-04-13 18:07:47,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:47,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245967982] [2025-04-13 18:07:47,272 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:47,277 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:47,282 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:07:47,282 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:47,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:47,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245967982] [2025-04-13 18:07:47,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245967982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:47,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:47,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:07:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810521282] [2025-04-13 18:07:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:47,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:07:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:47,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:07:47,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:07:47,379 INFO L87 Difference]: Start difference. First operand 16390 states and 76420 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:07:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:50,493 INFO L93 Difference]: Finished difference Result 18584 states and 86404 transitions. [2025-04-13 18:07:50,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:07:50,493 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:07:50,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:50,580 INFO L225 Difference]: With dead ends: 18584 [2025-04-13 18:07:50,581 INFO L226 Difference]: Without dead ends: 18577 [2025-04-13 18:07:50,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:07:50,588 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:50,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 49 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18577 states. [2025-04-13 18:07:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18577 to 16469. [2025-04-13 18:07:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16469 states, 16468 states have (on average 4.666261841146466) internal successors, (76844), 16468 states have internal predecessors, (76844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16469 states to 16469 states and 76844 transitions. [2025-04-13 18:07:52,663 INFO L79 Accepts]: Start accepts. Automaton has 16469 states and 76844 transitions. Word has length 31 [2025-04-13 18:07:52,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:52,664 INFO L485 AbstractCegarLoop]: Abstraction has 16469 states and 76844 transitions. [2025-04-13 18:07:52,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:07:52,664 INFO L278 IsEmpty]: Start isEmpty. Operand 16469 states and 76844 transitions. [2025-04-13 18:07:52,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:07:52,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:52,709 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, 1, 1, 1] [2025-04-13 18:07:52,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:07:52,709 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:07:52,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1193298550, now seen corresponding path program 4 times [2025-04-13 18:07:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:52,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075995627] [2025-04-13 18:07:52,710 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:52,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:52,716 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:52,726 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:07:52,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:53,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:53,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075995627] [2025-04-13 18:07:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075995627] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:53,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760321141] [2025-04-13 18:07:53,617 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:53,619 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 18:07:53,621 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 18:07:53,723 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:07:53,750 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:07:53,750 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:07:53,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:53,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 18:07:53,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:53,825 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 19 treesize of output 1 [2025-04-13 18:07:54,073 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 19 treesize of output 7 [2025-04-13 18:07:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:54,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:54,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760321141] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:54,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:54,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 20 [2025-04-13 18:07:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120660027] [2025-04-13 18:07:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:54,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:07:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:54,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:07:54,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:07:54,595 INFO L87 Difference]: Start difference. First operand 16469 states and 76844 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:08:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:00,374 INFO L93 Difference]: Finished difference Result 19940 states and 92081 transitions. [2025-04-13 18:08:00,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:08:00,374 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 31 [2025-04-13 18:08:00,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:00,510 INFO L225 Difference]: With dead ends: 19940 [2025-04-13 18:08:00,510 INFO L226 Difference]: Without dead ends: 19933 [2025-04-13 18:08:00,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:08:00,523 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 93 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:00,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 47 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19933 states. [2025-04-13 18:08:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19933 to 16938. [2025-04-13 18:08:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16938 states, 16937 states have (on average 4.669776229556592) internal successors, (79092), 16937 states have internal predecessors, (79092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 79092 transitions. [2025-04-13 18:08:04,745 INFO L79 Accepts]: Start accepts. Automaton has 16938 states and 79092 transitions. Word has length 31 [2025-04-13 18:08:04,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:04,746 INFO L485 AbstractCegarLoop]: Abstraction has 16938 states and 79092 transitions. [2025-04-13 18:08:04,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:08:04,746 INFO L278 IsEmpty]: Start isEmpty. Operand 16938 states and 79092 transitions. [2025-04-13 18:08:04,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:08:04,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:04,809 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, 1, 1, 1] [2025-04-13 18:08:04,822 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 18:08:05,009 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,SelfDestructingSolverStorable27 [2025-04-13 18:08:05,010 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:08:05,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1119969462, now seen corresponding path program 5 times [2025-04-13 18:08:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:05,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836299189] [2025-04-13 18:08:05,011 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:05,026 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:08:05,041 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:08:05,043 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:05,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:05,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:05,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836299189] [2025-04-13 18:08:05,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836299189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:05,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554566452] [2025-04-13 18:08:05,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:05,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:05,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:05,758 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 18:08:05,759 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 18:08:05,840 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:08:05,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:08:05,870 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:05,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:08:05,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:06,061 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 19 treesize of output 7 [2025-04-13 18:08:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:06,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:06,270 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:08:06,270 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 18:08:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554566452] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-13 18:08:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983171701] [2025-04-13 18:08:06,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:06,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:08:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:06,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:08:06,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:08:06,376 INFO L87 Difference]: Start difference. First operand 16938 states and 79092 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:08:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:10,578 INFO L93 Difference]: Finished difference Result 17910 states and 83306 transitions. [2025-04-13 18:08:10,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:08:10,579 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 31 [2025-04-13 18:08:10,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:10,654 INFO L225 Difference]: With dead ends: 17910 [2025-04-13 18:08:10,654 INFO L226 Difference]: Without dead ends: 17903 [2025-04-13 18:08:10,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:08:10,660 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:10,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 43 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17903 states. [2025-04-13 18:08:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17903 to 17235. [2025-04-13 18:08:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17235 states, 17234 states have (on average 4.673378205872114) internal successors, (80541), 17234 states have internal predecessors, (80541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17235 states to 17235 states and 80541 transitions. [2025-04-13 18:08:12,982 INFO L79 Accepts]: Start accepts. Automaton has 17235 states and 80541 transitions. Word has length 31 [2025-04-13 18:08:12,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:12,983 INFO L485 AbstractCegarLoop]: Abstraction has 17235 states and 80541 transitions. [2025-04-13 18:08:12,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 18:08:12,983 INFO L278 IsEmpty]: Start isEmpty. Operand 17235 states and 80541 transitions. [2025-04-13 18:08:13,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:08:13,021 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:13,021 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, 1, 1, 1] [2025-04-13 18:08:13,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 18:08:13,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:13,222 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:08:13,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1038484884, now seen corresponding path program 6 times [2025-04-13 18:08:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:13,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768160615] [2025-04-13 18:08:13,222 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:13,228 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:08:13,232 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 18:08:13,232 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:13,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:13,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768160615] [2025-04-13 18:08:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768160615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:13,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:08:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767118341] [2025-04-13 18:08:13,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:13,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:08:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:13,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:08:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:08:13,304 INFO L87 Difference]: Start difference. First operand 17235 states and 80541 transitions. Second operand has 7 states, 6 states have (on average 5.0) 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 18:08:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:16,583 INFO L93 Difference]: Finished difference Result 19502 states and 90844 transitions. [2025-04-13 18:08:16,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:08:16,583 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) 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 31 [2025-04-13 18:08:16,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:16,742 INFO L225 Difference]: With dead ends: 19502 [2025-04-13 18:08:16,742 INFO L226 Difference]: Without dead ends: 19495 [2025-04-13 18:08:16,749 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:08:16,750 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 62 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:16,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 39 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:08:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19495 states. [2025-04-13 18:08:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19495 to 17322. [2025-04-13 18:08:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17322 states, 17321 states have (on average 4.675134230125281) internal successors, (80978), 17321 states have internal predecessors, (80978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17322 states to 17322 states and 80978 transitions. [2025-04-13 18:08:20,823 INFO L79 Accepts]: Start accepts. Automaton has 17322 states and 80978 transitions. Word has length 31 [2025-04-13 18:08:20,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:20,824 INFO L485 AbstractCegarLoop]: Abstraction has 17322 states and 80978 transitions. [2025-04-13 18:08:20,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) 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 18:08:20,824 INFO L278 IsEmpty]: Start isEmpty. Operand 17322 states and 80978 transitions. [2025-04-13 18:08:20,874 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:08:20,874 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:20,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:20,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 18:08:20,874 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:08:20,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1556518140, now seen corresponding path program 7 times [2025-04-13 18:08:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:20,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920747707] [2025-04-13 18:08:20,875 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:20,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:08:20,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:08:20,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:20,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:21,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:21,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920747707] [2025-04-13 18:08:21,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920747707] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:21,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34454456] [2025-04-13 18:08:21,026 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:21,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:21,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:21,028 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 18:08:21,030 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 18:08:21,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:08:21,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:08:21,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:21,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:21,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:08:21,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:21,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34454456] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:21,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:21,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-04-13 18:08:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794404909] [2025-04-13 18:08:21,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:21,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:08:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:21,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:08:21,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:08:21,488 INFO L87 Difference]: Start difference. First operand 17322 states and 80978 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 15 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 18:08:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:27,311 INFO L93 Difference]: Finished difference Result 32836 states and 151842 transitions. [2025-04-13 18:08:27,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:08:27,311 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 15 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 34 [2025-04-13 18:08:27,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:27,448 INFO L225 Difference]: With dead ends: 32836 [2025-04-13 18:08:27,448 INFO L226 Difference]: Without dead ends: 17334 [2025-04-13 18:08:27,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:08:27,476 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 180 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:27,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 60 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17334 states. [2025-04-13 18:08:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17334 to 14462. [2025-04-13 18:08:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14462 states, 14461 states have (on average 4.424175368231796) internal successors, (63978), 14461 states have internal predecessors, (63978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14462 states to 14462 states and 63978 transitions. [2025-04-13 18:08:30,920 INFO L79 Accepts]: Start accepts. Automaton has 14462 states and 63978 transitions. Word has length 34 [2025-04-13 18:08:30,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:30,920 INFO L485 AbstractCegarLoop]: Abstraction has 14462 states and 63978 transitions. [2025-04-13 18:08:30,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 15 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 18:08:30,920 INFO L278 IsEmpty]: Start isEmpty. Operand 14462 states and 63978 transitions. [2025-04-13 18:08:30,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:08:30,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:30,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:30,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 18:08:31,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:31,166 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:08:31,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1021779361, now seen corresponding path program 8 times [2025-04-13 18:08:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:31,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499434882] [2025-04-13 18:08:31,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:31,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:31,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:08:31,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:08:31,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:31,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:31,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499434882] [2025-04-13 18:08:31,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499434882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:31,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238556494] [2025-04-13 18:08:31,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:31,320 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 18:08:31,323 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 18:08:31,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:08:31,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:08:31,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:31,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:31,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:08:31,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:31,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238556494] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:31,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:31,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-04-13 18:08:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594447013] [2025-04-13 18:08:31,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:31,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:08:31,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:31,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:08:31,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:08:31,838 INFO L87 Difference]: Start difference. First operand 14462 states and 63978 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:37,221 INFO L93 Difference]: Finished difference Result 23272 states and 101559 transitions. [2025-04-13 18:08:37,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:08:37,221 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 18:08:37,221 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:37,355 INFO L225 Difference]: With dead ends: 23272 [2025-04-13 18:08:37,355 INFO L226 Difference]: Without dead ends: 17626 [2025-04-13 18:08:37,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:08:37,372 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 239 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:37,372 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 76 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:08:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17626 states. [2025-04-13 18:08:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17626 to 15914. [2025-04-13 18:08:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15914 states, 15913 states have (on average 4.504556023377113) internal successors, (71681), 15913 states have internal predecessors, (71681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15914 states to 15914 states and 71681 transitions. [2025-04-13 18:08:39,795 INFO L79 Accepts]: Start accepts. Automaton has 15914 states and 71681 transitions. Word has length 34 [2025-04-13 18:08:39,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:39,795 INFO L485 AbstractCegarLoop]: Abstraction has 15914 states and 71681 transitions. [2025-04-13 18:08:39,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:39,795 INFO L278 IsEmpty]: Start isEmpty. Operand 15914 states and 71681 transitions. [2025-04-13 18:08:39,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:08:39,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:39,845 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, 1, 1] [2025-04-13 18:08:39,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:40,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:40,049 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:08:40,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash 537794019, now seen corresponding path program 9 times [2025-04-13 18:08:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:40,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775776489] [2025-04-13 18:08:40,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:40,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:08:40,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:08:40,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:08:40,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:08:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:40,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775776489] [2025-04-13 18:08:40,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775776489] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:40,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606590305] [2025-04-13 18:08:40,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:40,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:40,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:40,205 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 18:08:40,207 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 18:08:40,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:08:40,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:08:40,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:08:40,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:40,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 18:08:40,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:08:40,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:08:40,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606590305] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:40,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:40,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 15 [2025-04-13 18:08:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072846727] [2025-04-13 18:08:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:40,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:08:40,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:40,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:08:40,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:08:40,527 INFO L87 Difference]: Start difference. First operand 15914 states and 71681 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:44,618 INFO L93 Difference]: Finished difference Result 20589 states and 91686 transitions. [2025-04-13 18:08:44,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:08:44,619 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:08:44,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:44,758 INFO L225 Difference]: With dead ends: 20589 [2025-04-13 18:08:44,758 INFO L226 Difference]: Without dead ends: 20426 [2025-04-13 18:08:44,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:08:44,770 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:44,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 28 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20426 states. [2025-04-13 18:08:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20426 to 17348. [2025-04-13 18:08:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17348 states, 17347 states have (on average 4.493168847639361) internal successors, (77943), 17347 states have internal predecessors, (77943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17348 states to 17348 states and 77943 transitions. [2025-04-13 18:08:47,173 INFO L79 Accepts]: Start accepts. Automaton has 17348 states and 77943 transitions. Word has length 35 [2025-04-13 18:08:47,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:47,173 INFO L485 AbstractCegarLoop]: Abstraction has 17348 states and 77943 transitions. [2025-04-13 18:08:47,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:47,173 INFO L278 IsEmpty]: Start isEmpty. Operand 17348 states and 77943 transitions. [2025-04-13 18:08:47,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:08:47,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:47,208 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:47,214 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 18:08:47,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:47,408 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:08:47,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1917596090, now seen corresponding path program 1 times [2025-04-13 18:08:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:47,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273762060] [2025-04-13 18:08:47,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:47,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:08:47,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:08:47,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:47,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:47,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:47,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273762060] [2025-04-13 18:08:47,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273762060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:47,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068250131] [2025-04-13 18:08:47,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:47,523 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 18:08:47,526 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 18:08:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:08:47,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:08:47,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:47,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:47,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 18:08:47,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:47,748 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 18:08:47,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:08:47,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068250131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:47,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:08:47,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-04-13 18:08:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973482446] [2025-04-13 18:08:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:47,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:08:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:47,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:08:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:47,749 INFO L87 Difference]: Start difference. First operand 17348 states and 77943 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:50,903 INFO L93 Difference]: Finished difference Result 22715 states and 102009 transitions. [2025-04-13 18:08:50,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:08:50,903 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:08:50,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:51,000 INFO L225 Difference]: With dead ends: 22715 [2025-04-13 18:08:51,000 INFO L226 Difference]: Without dead ends: 22577 [2025-04-13 18:08:51,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:51,010 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:51,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 44 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22577 states. [2025-04-13 18:08:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22577 to 19273. [2025-04-13 18:08:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19273 states, 19272 states have (on average 4.50607098381071) internal successors, (86841), 19272 states have internal predecessors, (86841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19273 states to 19273 states and 86841 transitions. [2025-04-13 18:08:52,778 INFO L79 Accepts]: Start accepts. Automaton has 19273 states and 86841 transitions. Word has length 35 [2025-04-13 18:08:52,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:52,779 INFO L485 AbstractCegarLoop]: Abstraction has 19273 states and 86841 transitions. [2025-04-13 18:08:52,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:52,779 INFO L278 IsEmpty]: Start isEmpty. Operand 19273 states and 86841 transitions. [2025-04-13 18:08:52,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:08:52,820 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:52,820 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, 1, 1] [2025-04-13 18:08:52,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 18:08:53,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:53,021 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 2 more)] === [2025-04-13 18:08:53,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash 942543732, now seen corresponding path program 10 times [2025-04-13 18:08:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:53,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858643550] [2025-04-13 18:08:53,022 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:53,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 18:08:53,028 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 35 statements. [2025-04-13 18:08:53,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:53,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:08:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:53,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858643550] [2025-04-13 18:08:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858643550] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:53,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131455964] [2025-04-13 18:08:53,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:53,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:53,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:53,066 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 18:08:53,067 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 18:08:53,133 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 18:08:53,142 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 35 statements. [2025-04-13 18:08:53,142 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:53,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:53,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 18:08:53,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:08:53,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:08:53,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131455964] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:53,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:53,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 18:08:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729416364] [2025-04-13 18:08:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:53,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:08:53,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:53,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:08:53,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:53,377 INFO L87 Difference]: Start difference. First operand 19273 states and 86841 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:56,473 INFO L93 Difference]: Finished difference Result 30106 states and 134330 transitions. [2025-04-13 18:08:56,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:08:56,474 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:08:56,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:56,707 INFO L225 Difference]: With dead ends: 30106 [2025-04-13 18:08:56,708 INFO L226 Difference]: Without dead ends: 29520 [2025-04-13 18:08:56,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:56,734 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:56,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 28 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:08:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29520 states. [2025-04-13 18:08:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29520 to 23350. [2025-04-13 18:09:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23350 states, 23349 states have (on average 4.483104201464731) internal successors, (104676), 23349 states have internal predecessors, (104676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23350 states to 23350 states and 104676 transitions. [2025-04-13 18:09:00,226 INFO L79 Accepts]: Start accepts. Automaton has 23350 states and 104676 transitions. Word has length 35 [2025-04-13 18:09:00,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:00,227 INFO L485 AbstractCegarLoop]: Abstraction has 23350 states and 104676 transitions. [2025-04-13 18:09:00,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:00,227 INFO L278 IsEmpty]: Start isEmpty. Operand 23350 states and 104676 transitions. [2025-04-13 18:09:00,510 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:09:00,511 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:00,511 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:00,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 18:09:00,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:00,712 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 2 more)] === [2025-04-13 18:09:00,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:00,712 INFO L85 PathProgramCache]: Analyzing trace with hash 431473828, now seen corresponding path program 11 times [2025-04-13 18:09:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:00,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62560005] [2025-04-13 18:09:00,712 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:00,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:09:00,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:09:00,753 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:09:00,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:01,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:01,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62560005] [2025-04-13 18:09:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62560005] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:01,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402261135] [2025-04-13 18:09:01,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:01,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:01,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:01,865 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 18:09:01,872 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 18:09:01,967 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:09:02,004 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:09:02,004 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:09:02,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:02,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:09:02,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:02,469 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:02,469 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 36 treesize of output 12 [2025-04-13 18:09:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:09:02,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:02,920 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:09:02,920 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 18:09:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402261135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:02,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 8] total 29 [2025-04-13 18:09:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218787536] [2025-04-13 18:09:02,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:02,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:09:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:02,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:09:02,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:09:02,936 INFO L87 Difference]: Start difference. First operand 23350 states and 104676 transitions. Second operand has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:17,400 INFO L93 Difference]: Finished difference Result 55872 states and 248245 transitions. [2025-04-13 18:09:17,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 18:09:17,400 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:09:17,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:17,701 INFO L225 Difference]: With dead ends: 55872 [2025-04-13 18:09:17,701 INFO L226 Difference]: Without dead ends: 55712 [2025-04-13 18:09:17,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=798, Invalid=5364, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 18:09:17,725 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 1062 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 5744 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 5927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 5744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:17,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 761 Invalid, 5927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 5744 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 18:09:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55712 states. [2025-04-13 18:09:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55712 to 28200. [2025-04-13 18:09:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28200 states, 28199 states have (on average 4.5468279016986415) internal successors, (128216), 28199 states have internal predecessors, (128216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28200 states to 28200 states and 128216 transitions. [2025-04-13 18:09:21,453 INFO L79 Accepts]: Start accepts. Automaton has 28200 states and 128216 transitions. Word has length 38 [2025-04-13 18:09:21,453 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:21,453 INFO L485 AbstractCegarLoop]: Abstraction has 28200 states and 128216 transitions. [2025-04-13 18:09:21,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 30 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:21,453 INFO L278 IsEmpty]: Start isEmpty. Operand 28200 states and 128216 transitions. [2025-04-13 18:09:21,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:09:21,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:21,512 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, 1, 1, 1, 1, 1] [2025-04-13 18:09:21,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 18:09:21,713 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,SelfDestructingSolverStorable35 [2025-04-13 18:09:21,713 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 2 more)] === [2025-04-13 18:09:21,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -824664305, now seen corresponding path program 1 times [2025-04-13 18:09:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:21,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840833790] [2025-04-13 18:09:21,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:09:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:21,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:09:21,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:09:21,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:21,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:22,180 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 18:09:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:22,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840833790] [2025-04-13 18:09:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840833790] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:22,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137956047] [2025-04-13 18:09:22,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:09:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:22,182 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 18:09:22,183 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 18:09:22,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:09:22,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:09:22,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:22,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 18:09:22,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:22,520 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:22,520 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 36 treesize of output 12 [2025-04-13 18:09:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:22,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:22,782 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:09:22,783 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 18:09:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:22,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137956047] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:22,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 30 [2025-04-13 18:09:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297458036] [2025-04-13 18:09:22,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:22,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 18:09:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:22,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 18:09:22,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:22,790 INFO L87 Difference]: Start difference. First operand 28200 states and 128216 transitions. Second operand has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:37,400 INFO L93 Difference]: Finished difference Result 59662 states and 265681 transitions. [2025-04-13 18:09:37,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 18:09:37,400 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:09:37,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:37,673 INFO L225 Difference]: With dead ends: 59662 [2025-04-13 18:09:37,673 INFO L226 Difference]: Without dead ends: 59543 [2025-04-13 18:09:37,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=704, Invalid=4846, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 18:09:37,695 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 1278 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 5147 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 5343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 5147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:37,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 707 Invalid, 5343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 5147 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 18:09:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59543 states. [2025-04-13 18:09:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59543 to 31752. [2025-04-13 18:09:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31752 states, 31751 states have (on average 4.609492614405846) internal successors, (146356), 31751 states have internal predecessors, (146356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 146356 transitions. [2025-04-13 18:09:42,255 INFO L79 Accepts]: Start accepts. Automaton has 31752 states and 146356 transitions. Word has length 38 [2025-04-13 18:09:42,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:42,256 INFO L485 AbstractCegarLoop]: Abstraction has 31752 states and 146356 transitions. [2025-04-13 18:09:42,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:42,256 INFO L278 IsEmpty]: Start isEmpty. Operand 31752 states and 146356 transitions. [2025-04-13 18:09:42,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:09:42,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:42,329 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, 1, 1, 1, 1, 1] [2025-04-13 18:09:42,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 18:09:42,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 18:09:42,530 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 2 more)] === [2025-04-13 18:09:42,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1453287057, now seen corresponding path program 2 times [2025-04-13 18:09:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:42,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104971220] [2025-04-13 18:09:42,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:42,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:09:42,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:09:42,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:42,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:42,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:42,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104971220] [2025-04-13 18:09:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104971220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:42,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202928437] [2025-04-13 18:09:42,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:42,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:42,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:42,758 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 18:09:42,759 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 18:09:42,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:09:42,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:09:42,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:42,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:42,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:09:42,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:43,103 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:43,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-04-13 18:09:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:09:43,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202928437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:43,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 27 [2025-04-13 18:09:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748852193] [2025-04-13 18:09:43,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:43,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:09:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:43,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:09:43,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:09:43,309 INFO L87 Difference]: Start difference. First operand 31752 states and 146356 transitions. Second operand has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:00,010 INFO L93 Difference]: Finished difference Result 63284 states and 284452 transitions. [2025-04-13 18:10:00,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:10:00,011 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:10:00,011 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:00,344 INFO L225 Difference]: With dead ends: 63284 [2025-04-13 18:10:00,344 INFO L226 Difference]: Without dead ends: 63186 [2025-04-13 18:10:00,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=2175, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:10:00,370 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 921 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 3102 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:00,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 409 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3102 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:10:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63186 states. [2025-04-13 18:10:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63186 to 34515. [2025-04-13 18:10:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34515 states, 34514 states have (on average 4.654517007591123) internal successors, (160646), 34514 states have internal predecessors, (160646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34515 states to 34515 states and 160646 transitions. [2025-04-13 18:10:06,417 INFO L79 Accepts]: Start accepts. Automaton has 34515 states and 160646 transitions. Word has length 38 [2025-04-13 18:10:06,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:06,418 INFO L485 AbstractCegarLoop]: Abstraction has 34515 states and 160646 transitions. [2025-04-13 18:10:06,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:06,418 INFO L278 IsEmpty]: Start isEmpty. Operand 34515 states and 160646 transitions. [2025-04-13 18:10:06,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:10:06,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:06,496 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, 1, 1, 1, 1, 1] [2025-04-13 18:10:06,503 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 18:10:06,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 18:10:06,696 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:10:06,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2132374023, now seen corresponding path program 3 times [2025-04-13 18:10:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:06,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725826310] [2025-04-13 18:10:06,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:06,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:10:06,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:10:06,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:10:06,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:06,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725826310] [2025-04-13 18:10:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725826310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:06,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397068765] [2025-04-13 18:10:06,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:06,925 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 18:10:06,926 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 18:10:07,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:10:07,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:10:07,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:10:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:07,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:10:07,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:07,076 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 19 treesize of output 1 [2025-04-13 18:10:07,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:10:07,397 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:07,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2025-04-13 18:10:07,482 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 18:10:07,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397068765] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:07,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:07,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 32 [2025-04-13 18:10:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476331087] [2025-04-13 18:10:07,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:07,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:10:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:07,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:10:07,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:10:07,766 INFO L87 Difference]: Start difference. First operand 34515 states and 160646 transitions. Second operand has 33 states, 32 states have (on average 3.375) internal successors, (108), 33 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:25,860 INFO L93 Difference]: Finished difference Result 60619 states and 276843 transitions. [2025-04-13 18:10:25,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 18:10:25,861 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.375) internal successors, (108), 33 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:10:25,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:26,105 INFO L225 Difference]: With dead ends: 60619 [2025-04-13 18:10:26,105 INFO L226 Difference]: Without dead ends: 52140 [2025-04-13 18:10:26,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=849, Invalid=5631, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 18:10:26,133 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 1836 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 5057 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 5256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 5057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:26,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 753 Invalid, 5256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 5057 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 18:10:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52140 states. [2025-04-13 18:10:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52140 to 36845. [2025-04-13 18:10:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36845 states, 36844 states have (on average 4.642655520573228) internal successors, (171054), 36844 states have internal predecessors, (171054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36845 states to 36845 states and 171054 transitions. [2025-04-13 18:10:33,232 INFO L79 Accepts]: Start accepts. Automaton has 36845 states and 171054 transitions. Word has length 38 [2025-04-13 18:10:33,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:33,233 INFO L485 AbstractCegarLoop]: Abstraction has 36845 states and 171054 transitions. [2025-04-13 18:10:33,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.375) internal successors, (108), 33 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:33,233 INFO L278 IsEmpty]: Start isEmpty. Operand 36845 states and 171054 transitions. [2025-04-13 18:10:33,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:10:33,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:33,316 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, 1, 1, 1, 1, 1] [2025-04-13 18:10:33,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 18:10:33,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:33,517 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:10:33,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 61172547, now seen corresponding path program 4 times [2025-04-13 18:10:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:33,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560012966] [2025-04-13 18:10:33,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:33,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:10:33,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:10:33,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:10:33,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:33,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560012966] [2025-04-13 18:10:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560012966] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:33,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464890676] [2025-04-13 18:10:33,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:33,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:33,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:33,785 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 18:10:33,934 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 18:10:34,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-13 18:10:34,027 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:10:34,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:10:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:34,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 18:10:34,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:34,054 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 19 treesize of output 1 [2025-04-13 18:10:34,281 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:34,281 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 36 treesize of output 12 [2025-04-13 18:10:34,324 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 18:10:34,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:10:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464890676] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:34,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 8] total 29 [2025-04-13 18:10:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158375191] [2025-04-13 18:10:34,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:34,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:10:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:10:34,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:10:34,522 INFO L87 Difference]: Start difference. First operand 36845 states and 171054 transitions. Second operand has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:57,930 INFO L93 Difference]: Finished difference Result 66224 states and 300068 transitions. [2025-04-13 18:10:57,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 18:10:57,930 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:10:57,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:58,292 INFO L225 Difference]: With dead ends: 66224 [2025-04-13 18:10:58,293 INFO L226 Difference]: Without dead ends: 66150 [2025-04-13 18:10:58,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1979 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=838, Invalid=5482, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 18:10:58,315 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 1335 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 4884 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 5140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 4884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:58,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 660 Invalid, 5140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 4884 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 18:10:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66150 states. [2025-04-13 18:11:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66150 to 40986. [2025-04-13 18:11:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40986 states, 40985 states have (on average 4.70211052824204) internal successors, (192716), 40985 states have internal predecessors, (192716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:11:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40986 states to 40986 states and 192716 transitions. [2025-04-13 18:11:06,535 INFO L79 Accepts]: Start accepts. Automaton has 40986 states and 192716 transitions. Word has length 38 [2025-04-13 18:11:06,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:11:06,535 INFO L485 AbstractCegarLoop]: Abstraction has 40986 states and 192716 transitions. [2025-04-13 18:11:06,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 30 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:11:06,535 INFO L278 IsEmpty]: Start isEmpty. Operand 40986 states and 192716 transitions. [2025-04-13 18:11:06,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:11:06,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:11:06,630 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, 1, 1, 1, 1, 1] [2025-04-13 18:11:06,637 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 18:11:06,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 18:11:06,831 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:11:06,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:11:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1356770719, now seen corresponding path program 5 times [2025-04-13 18:11:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:11:06,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52837896] [2025-04-13 18:11:06,831 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:11:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:11:06,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:11:06,848 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:11:06,848 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:11:06,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:11:07,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:11:07,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52837896] [2025-04-13 18:11:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52837896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:11:07,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664511798] [2025-04-13 18:11:07,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:11:07,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:07,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:11:07,312 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 18:11:07,312 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 18:11:07,387 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:11:07,412 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:11:07,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:11:07,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:07,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 18:11:07,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:11:07,442 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 19 treesize of output 1 [2025-04-13 18:11:07,669 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:11:07,669 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 36 treesize of output 12 [2025-04-13 18:11:07,738 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 18:11:07,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:11:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:11:07,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664511798] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:11:07,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:11:07,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 34 [2025-04-13 18:11:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924641464] [2025-04-13 18:11:07,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:11:07,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:11:07,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:11:07,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:11:07,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:11:07,978 INFO L87 Difference]: Start difference. First operand 40986 states and 192716 transitions. Second operand has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 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 18:12:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:12:39,257 INFO L93 Difference]: Finished difference Result 271973 states and 1225648 transitions. [2025-04-13 18:12:39,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-04-13 18:12:39,257 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 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) Word has length 38 [2025-04-13 18:12:39,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:12:41,404 INFO L225 Difference]: With dead ends: 271973 [2025-04-13 18:12:41,404 INFO L226 Difference]: Without dead ends: 266291 [2025-04-13 18:12:41,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9306 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3238, Invalid=24152, Unknown=0, NotChecked=0, Total=27390 [2025-04-13 18:12:41,513 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 3156 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 10685 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3156 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 11450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 10685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:12:41,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3156 Valid, 1416 Invalid, 11450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 10685 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-04-13 18:12:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266291 states. [2025-04-13 18:13:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266291 to 113228. [2025-04-13 18:13:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113228 states, 113227 states have (on average 5.014166232435726) internal successors, (567739), 113227 states have internal predecessors, (567739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:13:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113228 states to 113228 states and 567739 transitions. [2025-04-13 18:13:13,543 INFO L79 Accepts]: Start accepts. Automaton has 113228 states and 567739 transitions. Word has length 38 [2025-04-13 18:13:13,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:13:13,543 INFO L485 AbstractCegarLoop]: Abstraction has 113228 states and 567739 transitions. [2025-04-13 18:13:13,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 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 18:13:13,543 INFO L278 IsEmpty]: Start isEmpty. Operand 113228 states and 567739 transitions. [2025-04-13 18:13:13,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:13:13,930 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:13:13,930 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, 1, 1, 1, 1, 1] [2025-04-13 18:13:13,937 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 18:13:14,130 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,SelfDestructingSolverStorable40 [2025-04-13 18:13:14,131 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:13:14,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:13:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1273418783, now seen corresponding path program 6 times [2025-04-13 18:13:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:13:14,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536900827] [2025-04-13 18:13:14,136 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:13:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:13:14,153 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:13:14,167 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:13:14,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:13:14,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:13:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:13:14,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536900827] [2025-04-13 18:13:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536900827] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:13:14,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588513521] [2025-04-13 18:13:14,538 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:13:14,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:14,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:13:14,543 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 18:13:14,548 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 18:13:14,708 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:13:14,753 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:13:14,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:13:14,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:14,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:13:14,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:13:15,149 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:13:15,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-04-13 18:13:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:13:15,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:13:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:13:15,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588513521] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:13:15,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:13:15,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 28 [2025-04-13 18:13:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86210378] [2025-04-13 18:13:15,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:13:15,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 18:13:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:13:15,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 18:13:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:13:15,460 INFO L87 Difference]: Start difference. First operand 113228 states and 567739 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:14:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:14:19,387 INFO L93 Difference]: Finished difference Result 169657 states and 830229 transitions. [2025-04-13 18:14:19,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:14:19,387 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:14:19,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:14:21,028 INFO L225 Difference]: With dead ends: 169657 [2025-04-13 18:14:21,029 INFO L226 Difference]: Without dead ends: 169536 [2025-04-13 18:14:21,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:14:21,108 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 986 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:14:21,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 350 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:14:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169536 states. [2025-04-13 18:14:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169536 to 125588. [2025-04-13 18:14:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125588 states, 125587 states have (on average 5.0371933400750075) internal successors, (632606), 125587 states have internal predecessors, (632606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:14:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125588 states to 125588 states and 632606 transitions. [2025-04-13 18:14:55,684 INFO L79 Accepts]: Start accepts. Automaton has 125588 states and 632606 transitions. Word has length 38 [2025-04-13 18:14:55,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:14:55,684 INFO L485 AbstractCegarLoop]: Abstraction has 125588 states and 632606 transitions. [2025-04-13 18:14:55,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:14:55,684 INFO L278 IsEmpty]: Start isEmpty. Operand 125588 states and 632606 transitions. [2025-04-13 18:14:56,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:14:56,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:14:56,075 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:14:56,081 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 18:14:56,275 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,SelfDestructingSolverStorable41 [2025-04-13 18:14:56,276 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:14:56,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:14:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash -592215096, now seen corresponding path program 12 times [2025-04-13 18:14:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:14:56,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908257976] [2025-04-13 18:14:56,277 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:14:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:14:56,285 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:14:56,299 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:14:56,299 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:14:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:14:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:14:56,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:14:56,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908257976] [2025-04-13 18:14:56,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908257976] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:14:56,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120632783] [2025-04-13 18:14:56,754 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:14:56,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:14:56,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:14:56,756 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 18:14:56,757 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 18:14:56,843 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:14:56,877 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:14:56,877 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:14:56,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:14:56,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 18:14:56,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:14:56,926 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 18:14:57,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:14:57,233 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 42 treesize of output 45 [2025-04-13 18:14:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:14:57,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:14:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:14:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120632783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:14:57,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:14:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 36 [2025-04-13 18:14:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814800094] [2025-04-13 18:14:57,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:14:57,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:14:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:14:57,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:14:57,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:14:57,741 INFO L87 Difference]: Start difference. First operand 125588 states and 632606 transitions. Second operand has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 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 18:15:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:15:57,787 INFO L93 Difference]: Finished difference Result 148552 states and 736402 transitions. [2025-04-13 18:15:57,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 18:15:57,788 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 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) Word has length 38 [2025-04-13 18:15:57,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:15:59,414 INFO L225 Difference]: With dead ends: 148552 [2025-04-13 18:15:59,414 INFO L226 Difference]: Without dead ends: 148413 [2025-04-13 18:15:59,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1046, Invalid=6964, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 18:15:59,469 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 1722 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 4269 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 4451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 4269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:15:59,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 634 Invalid, 4451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 4269 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:15:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148413 states. [2025-04-13 18:16:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148413 to 127902. [2025-04-13 18:16:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127902 states, 127901 states have (on average 5.037403929601801) internal successors, (644289), 127901 states have internal predecessors, (644289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:16:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127902 states to 127902 states and 644289 transitions. [2025-04-13 18:16:36,578 INFO L79 Accepts]: Start accepts. Automaton has 127902 states and 644289 transitions. Word has length 38 [2025-04-13 18:16:36,578 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:36,579 INFO L485 AbstractCegarLoop]: Abstraction has 127902 states and 644289 transitions. [2025-04-13 18:16:36,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 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 18:16:36,579 INFO L278 IsEmpty]: Start isEmpty. Operand 127902 states and 644289 transitions. [2025-04-13 18:16:36,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:16:36,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:36,950 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:36,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 18:16:37,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:37,151 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:16:37,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2127002088, now seen corresponding path program 13 times [2025-04-13 18:16:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:37,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846460321] [2025-04-13 18:16:37,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:16:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:37,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:16:37,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:16:37,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:16:37,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:37,607 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 18:16:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:37,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846460321] [2025-04-13 18:16:37,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846460321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:16:37,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056762270] [2025-04-13 18:16:37,607 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:16:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:16:37,609 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 18:16:37,610 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 18:16:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:16:37,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:16:37,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:16:37,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:37,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 18:16:37,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:16:37,937 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:16:37,937 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 37 treesize of output 13 [2025-04-13 18:16:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:16:38,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:16:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:16:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056762270] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:16:38,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:16:38,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 30 [2025-04-13 18:16:38,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800670262] [2025-04-13 18:16:38,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:16:38,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 18:16:38,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:38,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 18:16:38,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:16:38,206 INFO L87 Difference]: Start difference. First operand 127902 states and 644289 transitions. Second operand has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:17:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:17:49,877 INFO L93 Difference]: Finished difference Result 172206 states and 853966 transitions. [2025-04-13 18:17:49,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 18:17:49,877 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 31 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:17:49,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:17:51,436 INFO L225 Difference]: With dead ends: 172206 [2025-04-13 18:17:51,436 INFO L226 Difference]: Without dead ends: 172093 [2025-04-13 18:17:51,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1149, Invalid=6861, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 18:17:51,493 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 1265 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 3608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:17:51,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 490 Invalid, 3608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:17:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172093 states. Received shutdown request... [2025-04-13 18:18:10,504 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 18:18:10,504 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:18:11,526 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 18:18:11,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown