/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:33:49,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:33:49,538 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 22:33:49,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:33:49,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:33:49,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:33:49,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:33:49,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:33:49,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:33:49,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:33:49,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:33:49,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:33:49,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:33:49,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:33:49,569 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:33:49,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:33:49,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:33:49,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:33:49,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:33:49,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:33:49,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:33:49,572 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:33:49,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:33:49,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:33:49,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:33:49,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:33:49,815 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:33:49,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2025-04-13 22:33:51,093 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac602ee0/8de2ca167a8d48c5b5bf321157f0987a/FLAG6108c027a [2025-04-13 22:33:51,324 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:33:51,325 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2025-04-13 22:33:51,331 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac602ee0/8de2ca167a8d48c5b5bf321157f0987a/FLAG6108c027a [2025-04-13 22:33:52,143 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac602ee0/8de2ca167a8d48c5b5bf321157f0987a [2025-04-13 22:33:52,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:33:52,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:33:52,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:33:52,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:33:52,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:33:52,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689c4e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52, skipping insertion in model container [2025-04-13 22:33:52,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:33:52,364 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-2.wvr.c[4303,4316] [2025-04-13 22:33:52,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:33:52,388 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:33:52,419 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-2.wvr.c[4303,4316] [2025-04-13 22:33:52,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:33:52,437 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:33:52,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52 WrapperNode [2025-04-13 22:33:52,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:33:52,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:33:52,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:33:52,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:33:52,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,475 INFO L138 Inliner]: procedures = 28, calls = 58, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 370 [2025-04-13 22:33:52,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:33:52,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:33:52,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:33:52,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:33:52,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,498 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 22:33:52,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:33:52,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:33:52,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:33:52,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:33:52,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (1/1) ... [2025-04-13 22:33:52,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:33:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:52,548 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 22:33:52,549 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 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:33:52,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:33:52,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:33:52,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:33:52,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:33:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-13 22:33:52,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-13 22:33:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-13 22:33:52,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-13 22:33:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:33:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:33:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:33:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:33:52,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:33:52,566 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:33:52,662 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:33:52,663 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:33:53,075 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:33:53,075 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:33:53,076 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:33:53,476 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:33:53,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:33:53 BoogieIcfgContainer [2025-04-13 22:33:53,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:33:53,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:33:53,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:33:53,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:33:53,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:33:52" (1/3) ... [2025-04-13 22:33:53,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e53c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:33:53, skipping insertion in model container [2025-04-13 22:33:53,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:33:52" (2/3) ... [2025-04-13 22:33:53,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e53c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:33:53, skipping insertion in model container [2025-04-13 22:33:53,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:33:53" (3/3) ... [2025-04-13 22:33:53,484 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2025-04-13 22:33:53,496 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:33:53,498 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-2.wvr.c that has 7 procedures, 53 locations, 51 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 22:33:53,498 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:33:53,583 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-13 22:33:53,616 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 71 transitions, 208 flow [2025-04-13 22:33:54,147 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10300 states, 10299 states have (on average 5.164481988542577) internal successors, (53189), 10299 states have internal predecessors, (53189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:54,178 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:33:54,189 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;@13cb4904, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:33:54,189 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-13 22:33:54,217 INFO L278 IsEmpty]: Start isEmpty. Operand has 10300 states, 10299 states have (on average 5.164481988542577) internal successors, (53189), 10299 states have internal predecessors, (53189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:54,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:33:54,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:54,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:54,310 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:33:54,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1111624645, now seen corresponding path program 1 times [2025-04-13 22:33:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:54,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466848227] [2025-04-13 22:33:54,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:54,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:33:54,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:33:54,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:54,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:54,917 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 22:33:54,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:54,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466848227] [2025-04-13 22:33:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466848227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:33:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132246051] [2025-04-13 22:33:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:54,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:33:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:54,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:33:54,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:54,964 INFO L87 Difference]: Start difference. First operand has 10300 states, 10299 states have (on average 5.164481988542577) internal successors, (53189), 10299 states have internal predecessors, (53189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 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 22:33:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:55,981 INFO L93 Difference]: Finished difference Result 26503 states and 137752 transitions. [2025-04-13 22:33:55,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:33:55,984 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 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 37 [2025-04-13 22:33:55,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:56,112 INFO L225 Difference]: With dead ends: 26503 [2025-04-13 22:33:56,112 INFO L226 Difference]: Without dead ends: 10301 [2025-04-13 22:33:56,146 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:33:56,150 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:56,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:33:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10301 states. [2025-04-13 22:33:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10301 to 10301. [2025-04-13 22:33:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10301 states, 10300 states have (on average 5.1640776699029125) internal successors, (53190), 10300 states have internal predecessors, (53190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 53190 transitions. [2025-04-13 22:33:56,696 INFO L79 Accepts]: Start accepts. Automaton has 10301 states and 53190 transitions. Word has length 37 [2025-04-13 22:33:56,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:56,697 INFO L485 AbstractCegarLoop]: Abstraction has 10301 states and 53190 transitions. [2025-04-13 22:33:56,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 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 22:33:56,697 INFO L278 IsEmpty]: Start isEmpty. Operand 10301 states and 53190 transitions. [2025-04-13 22:33:56,733 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:33:56,733 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:56,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:56,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:33:56,733 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:33:56,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 696222849, now seen corresponding path program 1 times [2025-04-13 22:33:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:56,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49167680] [2025-04-13 22:33:56,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:33:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:56,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:33:56,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:33:56,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:56,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:57,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49167680] [2025-04-13 22:33:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49167680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:57,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:57,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921477221] [2025-04-13 22:33:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:57,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:57,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:57,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:57,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:57,143 INFO L87 Difference]: Start difference. First operand 10301 states and 53190 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:58,143 INFO L93 Difference]: Finished difference Result 28475 states and 147706 transitions. [2025-04-13 22:33:58,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:33:58,143 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 22:33:58,143 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:58,381 INFO L225 Difference]: With dead ends: 28475 [2025-04-13 22:33:58,381 INFO L226 Difference]: Without dead ends: 28443 [2025-04-13 22:33:58,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:33:58,401 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 133 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:58,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 23 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28443 states. [2025-04-13 22:33:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28443 to 12305. [2025-04-13 22:33:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12305 states, 12304 states have (on average 5.143449284785436) internal successors, (63285), 12304 states have internal predecessors, (63285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12305 states to 12305 states and 63285 transitions. [2025-04-13 22:33:59,174 INFO L79 Accepts]: Start accepts. Automaton has 12305 states and 63285 transitions. Word has length 38 [2025-04-13 22:33:59,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:59,175 INFO L485 AbstractCegarLoop]: Abstraction has 12305 states and 63285 transitions. [2025-04-13 22:33:59,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:59,176 INFO L278 IsEmpty]: Start isEmpty. Operand 12305 states and 63285 transitions. [2025-04-13 22:33:59,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:33:59,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:59,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:59,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:33:59,219 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:33:59,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1892150389, now seen corresponding path program 2 times [2025-04-13 22:33:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:59,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840915232] [2025-04-13 22:33:59,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:59,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 22:33:59,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 38 statements. [2025-04-13 22:33:59,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:59,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:59,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840915232] [2025-04-13 22:33:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840915232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:59,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:59,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:33:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025113491] [2025-04-13 22:33:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:59,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:33:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:59,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:33:59,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:33:59,529 INFO L87 Difference]: Start difference. First operand 12305 states and 63285 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:00,369 INFO L93 Difference]: Finished difference Result 28443 states and 147611 transitions. [2025-04-13 22:34:00,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:34:00,370 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 22:34:00,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:00,562 INFO L225 Difference]: With dead ends: 28443 [2025-04-13 22:34:00,562 INFO L226 Difference]: Without dead ends: 28356 [2025-04-13 22:34:00,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:34:00,579 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:00,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 23 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28356 states. [2025-04-13 22:34:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28356 to 12389. [2025-04-13 22:34:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12389 states, 12388 states have (on average 5.123183726186633) internal successors, (63466), 12388 states have internal predecessors, (63466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 63466 transitions. [2025-04-13 22:34:01,354 INFO L79 Accepts]: Start accepts. Automaton has 12389 states and 63466 transitions. Word has length 38 [2025-04-13 22:34:01,354 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:01,354 INFO L485 AbstractCegarLoop]: Abstraction has 12389 states and 63466 transitions. [2025-04-13 22:34:01,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:01,355 INFO L278 IsEmpty]: Start isEmpty. Operand 12389 states and 63466 transitions. [2025-04-13 22:34:01,396 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:34:01,396 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:01,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:01,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:34:01,396 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:01,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1125661741, now seen corresponding path program 1 times [2025-04-13 22:34:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:01,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157136393] [2025-04-13 22:34:01,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:01,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:34:01,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:34:01,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:01,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:01,627 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 22:34:01,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:01,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157136393] [2025-04-13 22:34:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157136393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:01,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026055528] [2025-04-13 22:34:01,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:01,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:01,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:01,630 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 22:34:01,632 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 22:34:01,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:34:01,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:34:01,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:01,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:01,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:34:01,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:01,820 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 22:34:01,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:01,873 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 22:34:01,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026055528] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:01,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:01,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-04-13 22:34:01,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140315418] [2025-04-13 22:34:01,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:01,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:01,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:01,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:01,875 INFO L87 Difference]: Start difference. First operand 12389 states and 63466 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:02,815 INFO L93 Difference]: Finished difference Result 36000 states and 185224 transitions. [2025-04-13 22:34:02,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:34:02,815 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 22:34:02,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:02,940 INFO L225 Difference]: With dead ends: 36000 [2025-04-13 22:34:02,940 INFO L226 Difference]: Without dead ends: 21913 [2025-04-13 22:34:02,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:34:02,975 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 136 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:02,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 36 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21913 states. [2025-04-13 22:34:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21913 to 17331. [2025-04-13 22:34:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17331 states, 17330 states have (on average 5.01194460473168) internal successors, (86857), 17330 states have internal predecessors, (86857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17331 states to 17331 states and 86857 transitions. [2025-04-13 22:34:03,788 INFO L79 Accepts]: Start accepts. Automaton has 17331 states and 86857 transitions. Word has length 41 [2025-04-13 22:34:03,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:03,790 INFO L485 AbstractCegarLoop]: Abstraction has 17331 states and 86857 transitions. [2025-04-13 22:34:03,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:03,790 INFO L278 IsEmpty]: Start isEmpty. Operand 17331 states and 86857 transitions. [2025-04-13 22:34:03,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:34:03,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:03,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:03,845 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 22:34:04,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:04,044 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:04,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash 91950152, now seen corresponding path program 1 times [2025-04-13 22:34:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:04,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862907411] [2025-04-13 22:34:04,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:04,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:34:04,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:34:04,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:04,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:04,214 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 22:34:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:04,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862907411] [2025-04-13 22:34:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862907411] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:04,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197678607] [2025-04-13 22:34:04,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:04,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:04,218 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 22:34:04,222 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 22:34:04,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:34:04,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:34:04,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:04,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:04,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:34:04,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:04,418 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 22:34:04,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:04,481 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 22:34:04,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197678607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:04,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:04,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-04-13 22:34:04,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580837396] [2025-04-13 22:34:04,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:04,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:04,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:04,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:04,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:04,483 INFO L87 Difference]: Start difference. First operand 17331 states and 86857 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:05,159 INFO L93 Difference]: Finished difference Result 19770 states and 97414 transitions. [2025-04-13 22:34:05,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:34:05,160 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 22:34:05,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:05,233 INFO L225 Difference]: With dead ends: 19770 [2025-04-13 22:34:05,233 INFO L226 Difference]: Without dead ends: 12390 [2025-04-13 22:34:05,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:34:05,246 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:05,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 30 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12390 states. [2025-04-13 22:34:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12390 to 12390. [2025-04-13 22:34:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12390 states, 12389 states have (on average 5.122850916135281) internal successors, (63467), 12389 states have internal predecessors, (63467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 63467 transitions. [2025-04-13 22:34:05,595 INFO L79 Accepts]: Start accepts. Automaton has 12390 states and 63467 transitions. Word has length 41 [2025-04-13 22:34:05,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:05,595 INFO L485 AbstractCegarLoop]: Abstraction has 12390 states and 63467 transitions. [2025-04-13 22:34:05,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:05,596 INFO L278 IsEmpty]: Start isEmpty. Operand 12390 states and 63467 transitions. [2025-04-13 22:34:05,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:34:05,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:05,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:05,628 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 22:34:05,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:05,823 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:05,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:05,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2133707907, now seen corresponding path program 2 times [2025-04-13 22:34:05,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:05,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554176576] [2025-04-13 22:34:05,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:05,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:34:05,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:34:05,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:05,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:05,917 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 22:34:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:05,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554176576] [2025-04-13 22:34:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554176576] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:05,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7067759] [2025-04-13 22:34:05,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:05,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:05,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:05,920 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 22:34:05,921 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 22:34:05,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:34:06,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:34:06,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:06,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:06,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:34:06,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:06,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7067759] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:06,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:06,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 12 [2025-04-13 22:34:06,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520988803] [2025-04-13 22:34:06,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:06,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:34:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:06,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:34:06,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:06,327 INFO L87 Difference]: Start difference. First operand 12390 states and 63467 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:07,174 INFO L93 Difference]: Finished difference Result 30702 states and 159797 transitions. [2025-04-13 22:34:07,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:34:07,175 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:34:07,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:07,376 INFO L225 Difference]: With dead ends: 30702 [2025-04-13 22:34:07,376 INFO L226 Difference]: Without dead ends: 28937 [2025-04-13 22:34:07,391 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:34:07,392 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:07,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 11 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28937 states. [2025-04-13 22:34:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28937 to 13182. [2025-04-13 22:34:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13182 states, 13181 states have (on average 5.188301342841969) internal successors, (68387), 13181 states have internal predecessors, (68387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13182 states to 13182 states and 68387 transitions. [2025-04-13 22:34:08,282 INFO L79 Accepts]: Start accepts. Automaton has 13182 states and 68387 transitions. Word has length 42 [2025-04-13 22:34:08,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:08,283 INFO L485 AbstractCegarLoop]: Abstraction has 13182 states and 68387 transitions. [2025-04-13 22:34:08,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:08,283 INFO L278 IsEmpty]: Start isEmpty. Operand 13182 states and 68387 transitions. [2025-04-13 22:34:08,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:34:08,318 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:08,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:08,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:34:08,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:08,523 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:08,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash -943647496, now seen corresponding path program 2 times [2025-04-13 22:34:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:08,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718215749] [2025-04-13 22:34:08,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:08,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:08,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:34:08,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:34:08,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:08,649 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 22:34:08,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:08,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718215749] [2025-04-13 22:34:08,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718215749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:08,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:08,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663883407] [2025-04-13 22:34:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:08,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:08,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:08,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:08,653 INFO L87 Difference]: Start difference. First operand 13182 states and 68387 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:09,982 INFO L93 Difference]: Finished difference Result 33137 states and 172731 transitions. [2025-04-13 22:34:09,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:34:09,982 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:34:09,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:10,187 INFO L225 Difference]: With dead ends: 33137 [2025-04-13 22:34:10,188 INFO L226 Difference]: Without dead ends: 32218 [2025-04-13 22:34:10,198 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:34:10,198 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 101 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:10,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 20 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32218 states. [2025-04-13 22:34:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32218 to 30027. [2025-04-13 22:34:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30027 states, 30026 states have (on average 5.321254912409246) internal successors, (159776), 30026 states have internal predecessors, (159776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30027 states to 30027 states and 159776 transitions. [2025-04-13 22:34:11,546 INFO L79 Accepts]: Start accepts. Automaton has 30027 states and 159776 transitions. Word has length 42 [2025-04-13 22:34:11,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:11,546 INFO L485 AbstractCegarLoop]: Abstraction has 30027 states and 159776 transitions. [2025-04-13 22:34:11,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:11,546 INFO L278 IsEmpty]: Start isEmpty. Operand 30027 states and 159776 transitions. [2025-04-13 22:34:11,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:34:11,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:11,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:11,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:34:11,626 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:11,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -74588104, now seen corresponding path program 3 times [2025-04-13 22:34:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:11,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001902522] [2025-04-13 22:34:11,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:11,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:11,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:34:11,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:34:11,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:34:11,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:11,701 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 22:34:11,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:11,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001902522] [2025-04-13 22:34:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001902522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:11,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79510896] [2025-04-13 22:34:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:11,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:11,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:11,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:11,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:11,702 INFO L87 Difference]: Start difference. First operand 30027 states and 159776 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:12,875 INFO L93 Difference]: Finished difference Result 37259 states and 196635 transitions. [2025-04-13 22:34:12,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:12,876 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:34:12,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:13,238 INFO L225 Difference]: With dead ends: 37259 [2025-04-13 22:34:13,238 INFO L226 Difference]: Without dead ends: 36262 [2025-04-13 22:34:13,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:34:13,250 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 83 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:13,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 22 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36262 states. [2025-04-13 22:34:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36262 to 30499. [2025-04-13 22:34:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30499 states, 30498 states have (on average 5.32185717096203) internal successors, (162306), 30498 states have internal predecessors, (162306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30499 states to 30499 states and 162306 transitions. [2025-04-13 22:34:14,637 INFO L79 Accepts]: Start accepts. Automaton has 30499 states and 162306 transitions. Word has length 42 [2025-04-13 22:34:14,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:14,637 INFO L485 AbstractCegarLoop]: Abstraction has 30499 states and 162306 transitions. [2025-04-13 22:34:14,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:14,638 INFO L278 IsEmpty]: Start isEmpty. Operand 30499 states and 162306 transitions. [2025-04-13 22:34:14,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:34:14,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:14,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:14,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:34:14,734 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:14,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -909595386, now seen corresponding path program 1 times [2025-04-13 22:34:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:14,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451031735] [2025-04-13 22:34:14,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:14,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:14,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:34:14,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:14,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:14,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:15,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451031735] [2025-04-13 22:34:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451031735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:15,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073249303] [2025-04-13 22:34:15,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:15,649 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 22:34:15,861 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 22:34:15,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:34:15,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:15,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:15,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:15,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:34:15,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:16,034 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 22:34:16,332 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 22:34:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:16,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073249303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:16,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2025-04-13 22:34:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734180571] [2025-04-13 22:34:16,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:16,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:34:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:16,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:34:16,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:34:16,588 INFO L87 Difference]: Start difference. First operand 30499 states and 162306 transitions. Second operand has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:20,060 INFO L93 Difference]: Finished difference Result 65522 states and 349871 transitions. [2025-04-13 22:34:20,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:34:20,061 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 0 states have call successors, (0), 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 45 [2025-04-13 22:34:20,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:20,459 INFO L225 Difference]: With dead ends: 65522 [2025-04-13 22:34:20,459 INFO L226 Difference]: Without dead ends: 65485 [2025-04-13 22:34:20,480 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:20,480 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 407 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:20,480 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 198 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:34:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65485 states. [2025-04-13 22:34:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65485 to 32735. [2025-04-13 22:34:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32735 states, 32734 states have (on average 5.331887334270178) internal successors, (174534), 32734 states have internal predecessors, (174534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32735 states to 32735 states and 174534 transitions. [2025-04-13 22:34:22,798 INFO L79 Accepts]: Start accepts. Automaton has 32735 states and 174534 transitions. Word has length 45 [2025-04-13 22:34:22,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:22,798 INFO L485 AbstractCegarLoop]: Abstraction has 32735 states and 174534 transitions. [2025-04-13 22:34:22,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:22,799 INFO L278 IsEmpty]: Start isEmpty. Operand 32735 states and 174534 transitions. [2025-04-13 22:34:22,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:34:22,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:22,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:22,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:34:23,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:23,101 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:23,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash -40535994, now seen corresponding path program 2 times [2025-04-13 22:34:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:23,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805361635] [2025-04-13 22:34:23,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:23,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:34:23,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:23,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:23,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:23,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805361635] [2025-04-13 22:34:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805361635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:23,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786972813] [2025-04-13 22:34:23,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:23,527 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 22:34:23,528 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 22:34:23,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:34:23,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:23,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:23,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:23,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:34:23,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:24,025 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 22:34:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:24,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:24,404 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:24,404 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 27 treesize of output 18 [2025-04-13 22:34:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786972813] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:24,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:24,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-04-13 22:34:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543233041] [2025-04-13 22:34:24,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:24,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:34:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:24,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:34:24,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:34:24,456 INFO L87 Difference]: Start difference. First operand 32735 states and 174534 transitions. Second operand has 24 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:28,880 INFO L93 Difference]: Finished difference Result 67858 states and 362869 transitions. [2025-04-13 22:34:28,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:34:28,880 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 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 45 [2025-04-13 22:34:28,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:29,284 INFO L225 Difference]: With dead ends: 67858 [2025-04-13 22:34:29,285 INFO L226 Difference]: Without dead ends: 67826 [2025-04-13 22:34:29,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=1486, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:34:29,305 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 711 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:29,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 308 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:34:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67826 states. [2025-04-13 22:34:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67826 to 32871. [2025-04-13 22:34:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32871 states, 32870 states have (on average 5.324186188013386) internal successors, (175006), 32870 states have internal predecessors, (175006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32871 states to 32871 states and 175006 transitions. [2025-04-13 22:34:31,943 INFO L79 Accepts]: Start accepts. Automaton has 32871 states and 175006 transitions. Word has length 45 [2025-04-13 22:34:31,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:31,944 INFO L485 AbstractCegarLoop]: Abstraction has 32871 states and 175006 transitions. [2025-04-13 22:34:31,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:31,944 INFO L278 IsEmpty]: Start isEmpty. Operand 32871 states and 175006 transitions. [2025-04-13 22:34:32,034 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:34:32,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:32,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:32,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:32,236 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,SelfDestructingSolverStorable9 [2025-04-13 22:34:32,236 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:32,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:32,237 INFO L85 PathProgramCache]: Analyzing trace with hash -704307996, now seen corresponding path program 3 times [2025-04-13 22:34:32,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:32,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246298251] [2025-04-13 22:34:32,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:32,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:32,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:34:32,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:32,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:34:32,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:33,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246298251] [2025-04-13 22:34:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246298251] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:33,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636180850] [2025-04-13 22:34:33,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:33,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:33,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:33,015 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 22:34:33,017 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 22:34:33,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:34:33,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:33,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:34:33,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:33,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:34:33,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:33,399 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 22:34:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:33,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:33,680 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:33,681 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 27 treesize of output 18 [2025-04-13 22:34:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:33,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636180850] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:33,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:33,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 25 [2025-04-13 22:34:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358827407] [2025-04-13 22:34:33,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:33,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:34:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:33,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:34:33,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:34:33,729 INFO L87 Difference]: Start difference. First operand 32871 states and 175006 transitions. Second operand has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:38,510 INFO L93 Difference]: Finished difference Result 55567 states and 294605 transitions. [2025-04-13 22:34:38,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:34:38,510 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 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 45 [2025-04-13 22:34:38,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:38,860 INFO L225 Difference]: With dead ends: 55567 [2025-04-13 22:34:38,861 INFO L226 Difference]: Without dead ends: 55485 [2025-04-13 22:34:38,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:34:38,881 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 541 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:38,881 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 316 Invalid, 3321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:34:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55485 states. [2025-04-13 22:34:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55485 to 32551. [2025-04-13 22:34:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32551 states, 32550 states have (on average 5.332350230414747) internal successors, (173568), 32550 states have internal predecessors, (173568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32551 states to 32551 states and 173568 transitions. [2025-04-13 22:34:41,271 INFO L79 Accepts]: Start accepts. Automaton has 32551 states and 173568 transitions. Word has length 45 [2025-04-13 22:34:41,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:41,271 INFO L485 AbstractCegarLoop]: Abstraction has 32551 states and 173568 transitions. [2025-04-13 22:34:41,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,271 INFO L278 IsEmpty]: Start isEmpty. Operand 32551 states and 173568 transitions. [2025-04-13 22:34:41,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:34:41,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:41,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:41,358 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 22:34:41,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:41,554 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:41,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 134932153, now seen corresponding path program 1 times [2025-04-13 22:34:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:41,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592319883] [2025-04-13 22:34:41,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:34:41,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:41,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:41,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:42,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592319883] [2025-04-13 22:34:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592319883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:42,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912280036] [2025-04-13 22:34:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:42,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:42,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:42,073 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 22:34:42,074 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 22:34:42,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:34:42,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:42,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:42,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:42,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:34:42,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:42,206 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 22:34:42,511 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 22:34:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:42,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912280036] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:42,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2025-04-13 22:34:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469289291] [2025-04-13 22:34:42,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:42,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:34:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:42,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:34:42,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:34:42,708 INFO L87 Difference]: Start difference. First operand 32551 states and 173568 transitions. Second operand has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:47,114 INFO L93 Difference]: Finished difference Result 56166 states and 299932 transitions. [2025-04-13 22:34:47,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:34:47,114 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 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 45 [2025-04-13 22:34:47,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:47,448 INFO L225 Difference]: With dead ends: 56166 [2025-04-13 22:34:47,448 INFO L226 Difference]: Without dead ends: 56134 [2025-04-13 22:34:47,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:34:47,469 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 267 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:47,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 223 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:34:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56134 states. [2025-04-13 22:34:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56134 to 33427. [2025-04-13 22:34:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33427 states, 33426 states have (on average 5.3241787829833065) internal successors, (177966), 33426 states have internal predecessors, (177966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33427 states to 33427 states and 177966 transitions. [2025-04-13 22:34:49,965 INFO L79 Accepts]: Start accepts. Automaton has 33427 states and 177966 transitions. Word has length 45 [2025-04-13 22:34:49,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:49,965 INFO L485 AbstractCegarLoop]: Abstraction has 33427 states and 177966 transitions. [2025-04-13 22:34:49,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:49,965 INFO L278 IsEmpty]: Start isEmpty. Operand 33427 states and 177966 transitions. [2025-04-13 22:34:50,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:34:50,046 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:50,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:50,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:50,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:50,250 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:50,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1576959158, now seen corresponding path program 4 times [2025-04-13 22:34:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:50,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636557456] [2025-04-13 22:34:50,250 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:50,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:34:50,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:50,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:50,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:50,619 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 22:34:50,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:50,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636557456] [2025-04-13 22:34:50,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636557456] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:50,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224296133] [2025-04-13 22:34:50,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:50,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:50,621 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 22:34:50,622 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 22:34:50,688 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:34:50,717 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:50,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:50,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:50,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:34:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:50,745 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 22:34:50,958 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 22:34:51,046 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 22:34:51,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:51,148 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 22:34:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224296133] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:51,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 20 [2025-04-13 22:34:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658056966] [2025-04-13 22:34:51,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:51,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:34:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:51,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:34:51,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:34:51,149 INFO L87 Difference]: Start difference. First operand 33427 states and 177966 transitions. Second operand has 21 states, 20 states have (on average 5.3) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:56,288 INFO L93 Difference]: Finished difference Result 58946 states and 314641 transitions. [2025-04-13 22:34:56,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:34:56,292 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.3) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 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 45 [2025-04-13 22:34:56,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:56,626 INFO L225 Difference]: With dead ends: 58946 [2025-04-13 22:34:56,626 INFO L226 Difference]: Without dead ends: 58914 [2025-04-13 22:34:56,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:34:56,644 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 386 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:56,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 223 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:34:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58914 states. [2025-04-13 22:34:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58914 to 33427. [2025-04-13 22:34:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33427 states, 33426 states have (on average 5.3241787829833065) internal successors, (177966), 33426 states have internal predecessors, (177966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33427 states to 33427 states and 177966 transitions. [2025-04-13 22:34:59,096 INFO L79 Accepts]: Start accepts. Automaton has 33427 states and 177966 transitions. Word has length 45 [2025-04-13 22:34:59,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:59,096 INFO L485 AbstractCegarLoop]: Abstraction has 33427 states and 177966 transitions. [2025-04-13 22:34:59,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.3) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:59,096 INFO L278 IsEmpty]: Start isEmpty. Operand 33427 states and 177966 transitions. [2025-04-13 22:34:59,431 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:34:59,431 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:59,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:59,596 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 22:34:59,635 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,SelfDestructingSolverStorable12 [2025-04-13 22:34:59,635 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:34:59,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash 162192633, now seen corresponding path program 2 times [2025-04-13 22:34:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:59,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476383933] [2025-04-13 22:34:59,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:59,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:59,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:34:59,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:34:59,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:59,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:59,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476383933] [2025-04-13 22:34:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476383933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:59,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303353400] [2025-04-13 22:34:59,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:59,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:59,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:59,906 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 22:34:59,907 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 22:34:59,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:00,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:00,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:00,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:00,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:35:00,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:00,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 22:35:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:00,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:00,504 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:00,504 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 27 treesize of output 18 [2025-04-13 22:35:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303353400] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:00,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:00,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-04-13 22:35:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455169252] [2025-04-13 22:35:00,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:00,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:35:00,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:00,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:35:00,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:35:00,543 INFO L87 Difference]: Start difference. First operand 33427 states and 177966 transitions. Second operand has 22 states, 21 states have (on average 5.809523809523809) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:07,032 INFO L93 Difference]: Finished difference Result 72486 states and 387383 transitions. [2025-04-13 22:35:07,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:35:07,033 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.809523809523809) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 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 45 [2025-04-13 22:35:07,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:07,451 INFO L225 Difference]: With dead ends: 72486 [2025-04-13 22:35:07,451 INFO L226 Difference]: Without dead ends: 72449 [2025-04-13 22:35:07,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:35:07,476 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 589 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 3264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:07,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 289 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3264 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:35:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72449 states. [2025-04-13 22:35:11,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72449 to 35605. [2025-04-13 22:35:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35605 states, 35604 states have (on average 5.353527693517583) internal successors, (190607), 35604 states have internal predecessors, (190607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35605 states to 35605 states and 190607 transitions. [2025-04-13 22:35:11,381 INFO L79 Accepts]: Start accepts. Automaton has 35605 states and 190607 transitions. Word has length 45 [2025-04-13 22:35:11,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:11,381 INFO L485 AbstractCegarLoop]: Abstraction has 35605 states and 190607 transitions. [2025-04-13 22:35:11,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.809523809523809) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:11,382 INFO L278 IsEmpty]: Start isEmpty. Operand 35605 states and 190607 transitions. [2025-04-13 22:35:11,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:35:11,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:11,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:11,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 22:35:11,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 22:35:11,688 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:35:11,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:11,689 INFO L85 PathProgramCache]: Analyzing trace with hash 631023895, now seen corresponding path program 3 times [2025-04-13 22:35:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:11,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670085950] [2025-04-13 22:35:11,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:11,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:11,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:11,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:11,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:35:11,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:12,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670085950] [2025-04-13 22:35:12,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670085950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:12,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945169732] [2025-04-13 22:35:12,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:12,245 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 22:35:12,246 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 22:35:12,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:12,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:12,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:35:12,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:12,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:35:12,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:12,648 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 22:35:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:12,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:12,799 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:12,799 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 27 treesize of output 18 [2025-04-13 22:35:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:12,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945169732] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:12,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:12,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2025-04-13 22:35:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597228409] [2025-04-13 22:35:12,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:12,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:35:12,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:12,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:35:12,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:35:12,840 INFO L87 Difference]: Start difference. First operand 35605 states and 190607 transitions. Second operand has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:19,719 INFO L93 Difference]: Finished difference Result 61702 states and 328568 transitions. [2025-04-13 22:35:19,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:35:19,719 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 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 45 [2025-04-13 22:35:19,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:20,316 INFO L225 Difference]: With dead ends: 61702 [2025-04-13 22:35:20,316 INFO L226 Difference]: Without dead ends: 61605 [2025-04-13 22:35:20,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:35:20,338 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 751 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 3422 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:20,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 282 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3422 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:35:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61605 states. [2025-04-13 22:35:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61605 to 35989. [2025-04-13 22:35:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35989 states, 35988 states have (on average 5.3609814382571965) internal successors, (192931), 35988 states have internal predecessors, (192931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35989 states to 35989 states and 192931 transitions. [2025-04-13 22:35:23,770 INFO L79 Accepts]: Start accepts. Automaton has 35989 states and 192931 transitions. Word has length 45 [2025-04-13 22:35:23,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:23,771 INFO L485 AbstractCegarLoop]: Abstraction has 35989 states and 192931 transitions. [2025-04-13 22:35:23,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:23,771 INFO L278 IsEmpty]: Start isEmpty. Operand 35989 states and 192931 transitions. [2025-04-13 22:35:23,873 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:35:23,873 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:23,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:23,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 22:35:24,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 22:35:24,074 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:35:24,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2045419651, now seen corresponding path program 4 times [2025-04-13 22:35:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:24,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820006509] [2025-04-13 22:35:24,075 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:24,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:24,089 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:24,104 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:24,105 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:24,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:24,544 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 22:35:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:24,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820006509] [2025-04-13 22:35:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820006509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:24,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095969499] [2025-04-13 22:35:24,544 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:24,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:24,546 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 22:35:24,549 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 22:35:24,658 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:24,713 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:24,713 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:24,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:24,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:35:24,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:24,753 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 22:35:25,019 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 22:35:25,068 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 22:35:25,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:25,179 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 22:35:25,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095969499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:25,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:25,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 20 [2025-04-13 22:35:25,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856245237] [2025-04-13 22:35:25,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:25,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:35:25,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:25,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:35:25,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:35:25,180 INFO L87 Difference]: Start difference. First operand 35989 states and 192931 transitions. Second operand has 21 states, 20 states have (on average 5.3) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:32,008 INFO L93 Difference]: Finished difference Result 59056 states and 316631 transitions. [2025-04-13 22:35:32,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:35:32,009 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.3) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 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 45 [2025-04-13 22:35:32,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:32,333 INFO L225 Difference]: With dead ends: 59056 [2025-04-13 22:35:32,333 INFO L226 Difference]: Without dead ends: 59024 [2025-04-13 22:35:32,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:35:32,353 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 318 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:32,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 218 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2357 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:35:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59024 states. [2025-04-13 22:35:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59024 to 35989. [2025-04-13 22:35:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35989 states, 35988 states have (on average 5.3609814382571965) internal successors, (192931), 35988 states have internal predecessors, (192931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35989 states to 35989 states and 192931 transitions. [2025-04-13 22:35:36,328 INFO L79 Accepts]: Start accepts. Automaton has 35989 states and 192931 transitions. Word has length 45 [2025-04-13 22:35:36,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:36,328 INFO L485 AbstractCegarLoop]: Abstraction has 35989 states and 192931 transitions. [2025-04-13 22:35:36,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.3) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:36,328 INFO L278 IsEmpty]: Start isEmpty. Operand 35989 states and 192931 transitions. [2025-04-13 22:35:36,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:35:36,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:36,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:36,435 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 22:35:36,629 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,SelfDestructingSolverStorable15 [2025-04-13 22:35:36,629 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:35:36,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash -873468990, now seen corresponding path program 5 times [2025-04-13 22:35:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:36,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205128606] [2025-04-13 22:35:36,630 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:36,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:36,639 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:36,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:36,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:36,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:37,179 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 22:35:37,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:37,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205128606] [2025-04-13 22:35:37,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205128606] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:37,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576491856] [2025-04-13 22:35:37,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:37,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:37,181 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 22:35:37,183 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 22:35:37,247 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:37,270 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:37,270 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:37,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:37,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:35:37,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:37,475 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 22:35:37,548 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 22:35:37,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:35:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576491856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:35:37,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-04-13 22:35:37,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288237675] [2025-04-13 22:35:37,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:37,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:35:37,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:37,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:35:37,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:35:37,549 INFO L87 Difference]: Start difference. First operand 35989 states and 192931 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:42,195 INFO L93 Difference]: Finished difference Result 47437 states and 253855 transitions. [2025-04-13 22:35:42,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:35:42,195 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:35:42,195 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:42,446 INFO L225 Difference]: With dead ends: 47437 [2025-04-13 22:35:42,446 INFO L226 Difference]: Without dead ends: 47400 [2025-04-13 22:35:42,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:35:42,461 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 149 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:42,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 89 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47400 states. [2025-04-13 22:35:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47400 to 37005. [2025-04-13 22:35:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37005 states, 37004 states have (on average 5.363231002053832) internal successors, (198461), 37004 states have internal predecessors, (198461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37005 states to 37005 states and 198461 transitions. [2025-04-13 22:35:45,984 INFO L79 Accepts]: Start accepts. Automaton has 37005 states and 198461 transitions. Word has length 45 [2025-04-13 22:35:45,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:45,984 INFO L485 AbstractCegarLoop]: Abstraction has 37005 states and 198461 transitions. [2025-04-13 22:35:45,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:45,984 INFO L278 IsEmpty]: Start isEmpty. Operand 37005 states and 198461 transitions. [2025-04-13 22:35:46,109 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:35:46,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:46,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:46,116 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 22:35:46,312 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,SelfDestructingSolverStorable16 [2025-04-13 22:35:46,312 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:35:46,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -403223806, now seen corresponding path program 6 times [2025-04-13 22:35:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:46,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191121636] [2025-04-13 22:35:46,313 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:46,335 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:35:46,358 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 45 statements. [2025-04-13 22:35:46,358 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:46,641 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 22:35:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:46,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191121636] [2025-04-13 22:35:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191121636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:46,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:46,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:35:46,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966281619] [2025-04-13 22:35:46,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:46,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:35:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:46,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:35:46,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:35:46,642 INFO L87 Difference]: Start difference. First operand 37005 states and 198461 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:52,559 INFO L93 Difference]: Finished difference Result 58150 states and 311766 transitions. [2025-04-13 22:35:52,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:35:52,559 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:35:52,559 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:52,891 INFO L225 Difference]: With dead ends: 58150 [2025-04-13 22:35:52,892 INFO L226 Difference]: Without dead ends: 58118 [2025-04-13 22:35:52,911 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:35:52,912 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 180 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:52,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 96 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58118 states. [2025-04-13 22:35:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58118 to 37005. [2025-04-13 22:35:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37005 states, 37004 states have (on average 5.363231002053832) internal successors, (198461), 37004 states have internal predecessors, (198461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37005 states to 37005 states and 198461 transitions. [2025-04-13 22:35:56,765 INFO L79 Accepts]: Start accepts. Automaton has 37005 states and 198461 transitions. Word has length 45 [2025-04-13 22:35:56,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:56,766 INFO L485 AbstractCegarLoop]: Abstraction has 37005 states and 198461 transitions. [2025-04-13 22:35:56,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:56,767 INFO L278 IsEmpty]: Start isEmpty. Operand 37005 states and 198461 transitions. [2025-04-13 22:35:56,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:35:56,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:56,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:56,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:35:56,867 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:35:56,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:56,867 INFO L85 PathProgramCache]: Analyzing trace with hash -668181600, now seen corresponding path program 7 times [2025-04-13 22:35:56,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:56,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838995143] [2025-04-13 22:35:56,867 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:56,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:35:56,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:56,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:56,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:57,424 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 22:35:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:57,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838995143] [2025-04-13 22:35:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838995143] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:57,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528907346] [2025-04-13 22:35:57,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:57,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:57,426 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 22:35:57,427 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 22:35:57,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:35:57,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:35:57,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:57,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:57,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:35:57,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:57,542 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 22:35:57,744 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 22:35:57,831 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 22:35:57,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:57,933 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 22:35:57,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528907346] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:57,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:57,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 25 [2025-04-13 22:35:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189125557] [2025-04-13 22:35:57,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:57,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:35:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:57,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:35:57,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:35:57,934 INFO L87 Difference]: Start difference. First operand 37005 states and 198461 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:03,520 INFO L93 Difference]: Finished difference Result 47600 states and 254435 transitions. [2025-04-13 22:36:03,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:36:03,520 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:36:03,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:03,783 INFO L225 Difference]: With dead ends: 47600 [2025-04-13 22:36:03,783 INFO L226 Difference]: Without dead ends: 47518 [2025-04-13 22:36:03,798 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:36:03,799 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 160 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:03,799 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 81 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47518 states. [2025-04-13 22:36:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47518 to 36101. [2025-04-13 22:36:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36101 states, 36100 states have (on average 5.361246537396122) internal successors, (193541), 36100 states have internal predecessors, (193541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36101 states to 36101 states and 193541 transitions. [2025-04-13 22:36:07,548 INFO L79 Accepts]: Start accepts. Automaton has 36101 states and 193541 transitions. Word has length 45 [2025-04-13 22:36:07,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:07,548 INFO L485 AbstractCegarLoop]: Abstraction has 36101 states and 193541 transitions. [2025-04-13 22:36:07,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:07,548 INFO L278 IsEmpty]: Start isEmpty. Operand 36101 states and 193541 transitions. [2025-04-13 22:36:07,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:36:07,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:07,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:07,637 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 22:36:07,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:07,832 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:36:07,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1369800230, now seen corresponding path program 8 times [2025-04-13 22:36:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:07,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994141354] [2025-04-13 22:36:07,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:07,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:07,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:07,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:07,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:08,173 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 22:36:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:08,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994141354] [2025-04-13 22:36:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994141354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:08,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355868837] [2025-04-13 22:36:08,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:08,176 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 22:36:08,176 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 22:36:08,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:08,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:08,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:08,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:08,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:36:08,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:08,479 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 22:36:08,553 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 22:36:08,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:08,630 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:08,630 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 27 treesize of output 18 [2025-04-13 22:36:08,665 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 22:36:08,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355868837] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:08,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:08,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2025-04-13 22:36:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445397110] [2025-04-13 22:36:08,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:08,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:36:08,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:08,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:36:08,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:36:08,666 INFO L87 Difference]: Start difference. First operand 36101 states and 193541 transitions. Second operand has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:17,484 INFO L93 Difference]: Finished difference Result 56695 states and 303075 transitions. [2025-04-13 22:36:17,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:36:17,484 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 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 45 [2025-04-13 22:36:17,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:17,947 INFO L225 Difference]: With dead ends: 56695 [2025-04-13 22:36:17,947 INFO L226 Difference]: Without dead ends: 56663 [2025-04-13 22:36:17,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1442, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:36:17,964 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 734 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 3315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 3328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:17,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 292 Invalid, 3328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3315 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:36:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56663 states. [2025-04-13 22:36:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56663 to 37035. [2025-04-13 22:36:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37035 states, 37034 states have (on average 5.364529891451099) internal successors, (198670), 37034 states have internal predecessors, (198670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37035 states to 37035 states and 198670 transitions. [2025-04-13 22:36:22,122 INFO L79 Accepts]: Start accepts. Automaton has 37035 states and 198670 transitions. Word has length 45 [2025-04-13 22:36:22,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:22,123 INFO L485 AbstractCegarLoop]: Abstraction has 37035 states and 198670 transitions. [2025-04-13 22:36:22,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:22,123 INFO L278 IsEmpty]: Start isEmpty. Operand 37035 states and 198670 transitions. [2025-04-13 22:36:22,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:36:22,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:22,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:22,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:22,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:22,431 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:36:22,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1905397958, now seen corresponding path program 9 times [2025-04-13 22:36:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:22,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548341250] [2025-04-13 22:36:22,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:22,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:22,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:22,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:22,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:23,082 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 22:36:23,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:23,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548341250] [2025-04-13 22:36:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548341250] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:23,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298432790] [2025-04-13 22:36:23,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:23,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:23,091 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 22:36:23,097 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 22:36:23,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:23,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:23,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:23,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:23,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:36:23,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:23,636 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 22:36:23,704 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 22:36:23,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:23,789 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:23,789 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 27 treesize of output 18 [2025-04-13 22:36:23,822 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 22:36:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298432790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:23,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:23,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2025-04-13 22:36:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997237540] [2025-04-13 22:36:23,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:23,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:36:23,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:23,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:36:23,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:36:23,823 INFO L87 Difference]: Start difference. First operand 37035 states and 198670 transitions. Second operand has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:33,587 INFO L93 Difference]: Finished difference Result 59267 states and 316724 transitions. [2025-04-13 22:36:33,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:36:33,588 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 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 45 [2025-04-13 22:36:33,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:34,058 INFO L225 Difference]: With dead ends: 59267 [2025-04-13 22:36:34,058 INFO L226 Difference]: Without dead ends: 59180 [2025-04-13 22:36:34,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:36:34,075 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 956 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 3033 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:34,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 270 Invalid, 3060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3033 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:36:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59180 states. [2025-04-13 22:36:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59180 to 36395. [2025-04-13 22:36:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36395 states, 36394 states have (on average 5.3623674232016265) internal successors, (195158), 36394 states have internal predecessors, (195158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36395 states to 36395 states and 195158 transitions. [2025-04-13 22:36:38,075 INFO L79 Accepts]: Start accepts. Automaton has 36395 states and 195158 transitions. Word has length 45 [2025-04-13 22:36:38,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:38,075 INFO L485 AbstractCegarLoop]: Abstraction has 36395 states and 195158 transitions. [2025-04-13 22:36:38,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:38,075 INFO L278 IsEmpty]: Start isEmpty. Operand 36395 states and 195158 transitions. [2025-04-13 22:36:38,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:36:38,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:38,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:38,169 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 22:36:38,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:38,364 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:36:38,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash -376675390, now seen corresponding path program 10 times [2025-04-13 22:36:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:38,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812383525] [2025-04-13 22:36:38,365 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:38,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:38,378 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:38,378 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:36:38,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:38,635 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 22:36:38,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:38,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812383525] [2025-04-13 22:36:38,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812383525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:38,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836240869] [2025-04-13 22:36:38,636 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:38,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:38,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:38,638 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 22:36:38,640 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 22:36:38,722 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:38,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:38,755 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:36:38,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:38,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:36:38,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:38,784 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 22:36:38,971 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 22:36:39,055 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 22:36:39,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:39,153 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 22:36:39,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836240869] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:39,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:39,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2025-04-13 22:36:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465744743] [2025-04-13 22:36:39,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:39,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:36:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:39,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:36:39,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:36:39,154 INFO L87 Difference]: Start difference. First operand 36395 states and 195158 transitions. Second operand has 23 states, 22 states have (on average 5.0) internal successors, (110), 23 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:47,136 INFO L93 Difference]: Finished difference Result 58287 states and 312451 transitions. [2025-04-13 22:36:47,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:36:47,137 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.0) internal successors, (110), 23 states have internal predecessors, (110), 0 states have call successors, (0), 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 45 [2025-04-13 22:36:47,137 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:47,472 INFO L225 Difference]: With dead ends: 58287 [2025-04-13 22:36:47,472 INFO L226 Difference]: Without dead ends: 58250 [2025-04-13 22:36:47,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:36:47,497 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 307 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:47,497 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 203 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:36:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58250 states. [2025-04-13 22:36:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58250 to 36325. [2025-04-13 22:36:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36325 states, 36324 states have (on average 5.364084351943618) internal successors, (194845), 36324 states have internal predecessors, (194845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36325 states to 36325 states and 194845 transitions. [2025-04-13 22:36:51,993 INFO L79 Accepts]: Start accepts. Automaton has 36325 states and 194845 transitions. Word has length 45 [2025-04-13 22:36:51,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:51,993 INFO L485 AbstractCegarLoop]: Abstraction has 36325 states and 194845 transitions. [2025-04-13 22:36:51,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.0) internal successors, (110), 23 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:51,993 INFO L278 IsEmpty]: Start isEmpty. Operand 36325 states and 194845 transitions. [2025-04-13 22:36:52,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:36:52,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:52,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:52,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 22:36:52,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 22:36:52,492 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:36:52,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 371724901, now seen corresponding path program 5 times [2025-04-13 22:36:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:52,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782355180] [2025-04-13 22:36:52,493 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:52,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:52,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:52,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:52,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:52,974 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 22:36:52,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:52,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782355180] [2025-04-13 22:36:52,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782355180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:52,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312724488] [2025-04-13 22:36:52,975 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:52,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:52,977 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 22:36:52,977 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 22:36:53,052 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:36:53,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:36:53,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:53,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:53,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:36:53,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:53,110 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 22:36:53,332 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 22:36:53,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 22:36:53,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:53,465 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 22:36:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312724488] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:53,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2025-04-13 22:36:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673169850] [2025-04-13 22:36:53,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:53,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:36:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:53,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:36:53,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:36:53,466 INFO L87 Difference]: Start difference. First operand 36325 states and 194845 transitions. Second operand has 23 states, 22 states have (on average 5.409090909090909) internal successors, (119), 23 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:02,897 INFO L93 Difference]: Finished difference Result 66015 states and 353891 transitions. [2025-04-13 22:37:02,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:37:02,897 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.409090909090909) internal successors, (119), 23 states have internal predecessors, (119), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:02,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:03,360 INFO L225 Difference]: With dead ends: 66015 [2025-04-13 22:37:03,361 INFO L226 Difference]: Without dead ends: 65978 [2025-04-13 22:37:03,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:37:03,386 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 272 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:03,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 170 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:37:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65978 states. [2025-04-13 22:37:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65978 to 37127. [2025-04-13 22:37:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37127 states, 37126 states have (on average 5.368905888056887) internal successors, (199326), 37126 states have internal predecessors, (199326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37127 states to 37127 states and 199326 transitions. [2025-04-13 22:37:08,257 INFO L79 Accepts]: Start accepts. Automaton has 37127 states and 199326 transitions. Word has length 45 [2025-04-13 22:37:08,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:08,257 INFO L485 AbstractCegarLoop]: Abstraction has 37127 states and 199326 transitions. [2025-04-13 22:37:08,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.409090909090909) internal successors, (119), 23 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:08,257 INFO L278 IsEmpty]: Start isEmpty. Operand 37127 states and 199326 transitions. [2025-04-13 22:37:08,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:08,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:08,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:08,352 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 22:37:08,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:08,546 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:37:08,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash 125701163, now seen corresponding path program 6 times [2025-04-13 22:37:08,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:08,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507539708] [2025-04-13 22:37:08,547 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:08,554 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:37:08,563 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:08,563 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:37:08,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:09,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:09,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507539708] [2025-04-13 22:37:09,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507539708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:09,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959360680] [2025-04-13 22:37:09,113 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:09,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:09,115 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 22:37:09,118 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 22:37:09,194 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:37:09,218 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:09,218 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:37:09,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:09,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:37:09,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:09,444 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 22:37:09,498 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 22:37:09,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:09,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:09,599 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 27 treesize of output 18 [2025-04-13 22:37:09,633 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 22:37:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959360680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:37:09,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:37:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-04-13 22:37:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705337588] [2025-04-13 22:37:09,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:37:09,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:37:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:09,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:37:09,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:37:09,635 INFO L87 Difference]: Start difference. First operand 37127 states and 199326 transitions. Second operand has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:18,413 INFO L93 Difference]: Finished difference Result 52714 states and 282191 transitions. [2025-04-13 22:37:18,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:37:18,413 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:18,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:18,764 INFO L225 Difference]: With dead ends: 52714 [2025-04-13 22:37:18,765 INFO L226 Difference]: Without dead ends: 52632 [2025-04-13 22:37:18,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:37:18,786 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 977 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:18,788 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 216 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:37:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52632 states. [2025-04-13 22:37:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52632 to 36675. [2025-04-13 22:37:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36675 states, 36674 states have (on average 5.367780989256694) internal successors, (196858), 36674 states have internal predecessors, (196858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36675 states to 36675 states and 196858 transitions. [2025-04-13 22:37:23,729 INFO L79 Accepts]: Start accepts. Automaton has 36675 states and 196858 transitions. Word has length 45 [2025-04-13 22:37:23,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:23,730 INFO L485 AbstractCegarLoop]: Abstraction has 36675 states and 196858 transitions. [2025-04-13 22:37:23,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:23,730 INFO L278 IsEmpty]: Start isEmpty. Operand 36675 states and 196858 transitions. [2025-04-13 22:37:23,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:23,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:23,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:23,824 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 22:37:24,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:24,018 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:37:24,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 167546529, now seen corresponding path program 7 times [2025-04-13 22:37:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:24,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123317200] [2025-04-13 22:37:24,019 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:24,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:24,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:24,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:24,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:24,608 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 22:37:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:24,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123317200] [2025-04-13 22:37:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123317200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:24,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552930371] [2025-04-13 22:37:24,608 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:24,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:24,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:24,610 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 22:37:24,611 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 22:37:24,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:24,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:24,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:24,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:24,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:37:24,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:24,734 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 22:37:24,938 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 22:37:25,007 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 22:37:25,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:25,127 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 22:37:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552930371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:37:25,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:37:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2025-04-13 22:37:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213454650] [2025-04-13 22:37:25,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:37:25,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:37:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:25,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:37:25,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:37:25,128 INFO L87 Difference]: Start difference. First operand 36675 states and 196858 transitions. Second operand has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:34,386 INFO L93 Difference]: Finished difference Result 57779 states and 309985 transitions. [2025-04-13 22:37:34,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:37:34,386 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:34,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:34,740 INFO L225 Difference]: With dead ends: 57779 [2025-04-13 22:37:34,740 INFO L226 Difference]: Without dead ends: 57742 [2025-04-13 22:37:34,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:34,759 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 243 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:34,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 192 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:37:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57742 states. [2025-04-13 22:37:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57742 to 36507. [2025-04-13 22:37:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36507 states, 36506 states have (on average 5.366843806497562) internal successors, (195922), 36506 states have internal predecessors, (195922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36507 states to 36507 states and 195922 transitions. [2025-04-13 22:37:39,831 INFO L79 Accepts]: Start accepts. Automaton has 36507 states and 195922 transitions. Word has length 45 [2025-04-13 22:37:39,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:39,831 INFO L485 AbstractCegarLoop]: Abstraction has 36507 states and 195922 transitions. [2025-04-13 22:37:39,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:39,832 INFO L278 IsEmpty]: Start isEmpty. Operand 36507 states and 195922 transitions. [2025-04-13 22:37:39,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:39,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:39,927 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 22:37:40,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:40,121 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:37:40,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1897085707, now seen corresponding path program 8 times [2025-04-13 22:37:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:40,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191769208] [2025-04-13 22:37:40,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:40,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:37:40,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 45 statements. [2025-04-13 22:37:40,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:40,819 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 22:37:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:40,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191769208] [2025-04-13 22:37:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191769208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:40,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:40,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:37:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111253288] [2025-04-13 22:37:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:40,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:37:40,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:40,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:37:40,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:37:40,821 INFO L87 Difference]: Start difference. First operand 36507 states and 195922 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:51,012 INFO L93 Difference]: Finished difference Result 65222 states and 350137 transitions. [2025-04-13 22:37:51,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:37:51,012 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:51,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:51,437 INFO L225 Difference]: With dead ends: 65222 [2025-04-13 22:37:51,437 INFO L226 Difference]: Without dead ends: 65185 [2025-04-13 22:37:51,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:37:51,461 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 249 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:51,462 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:37:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65185 states. [2025-04-13 22:37:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65185 to 37883. [2025-04-13 22:37:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37883 states, 37882 states have (on average 5.384034633863048) internal successors, (203958), 37882 states have internal predecessors, (203958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37883 states to 37883 states and 203958 transitions. [2025-04-13 22:37:56,875 INFO L79 Accepts]: Start accepts. Automaton has 37883 states and 203958 transitions. Word has length 45 [2025-04-13 22:37:56,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:56,875 INFO L485 AbstractCegarLoop]: Abstraction has 37883 states and 203958 transitions. [2025-04-13 22:37:56,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:56,875 INFO L278 IsEmpty]: Start isEmpty. Operand 37883 states and 203958 transitions. [2025-04-13 22:37:56,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:56,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:56,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:56,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 22:37:56,979 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:37:56,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 569637907, now seen corresponding path program 9 times [2025-04-13 22:37:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:56,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161328477] [2025-04-13 22:37:56,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:56,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:37:57,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 45 statements. [2025-04-13 22:37:57,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:57,234 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 22:37:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:57,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161328477] [2025-04-13 22:37:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161328477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:37:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602174896] [2025-04-13 22:37:57,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:57,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:37:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:57,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:37:57,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:37:57,236 INFO L87 Difference]: Start difference. First operand 37883 states and 203958 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:08,729 INFO L93 Difference]: Finished difference Result 65381 states and 350690 transitions. [2025-04-13 22:38:08,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:38:08,730 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:38:08,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:09,086 INFO L225 Difference]: With dead ends: 65381 [2025-04-13 22:38:09,086 INFO L226 Difference]: Without dead ends: 65299 [2025-04-13 22:38:09,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:38:09,109 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 257 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:09,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 77 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:38:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65299 states. [2025-04-13 22:38:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65299 to 37515. [2025-04-13 22:38:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37515 states, 37514 states have (on average 5.38689555899131) internal successors, (202084), 37514 states have internal predecessors, (202084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37515 states to 37515 states and 202084 transitions. [2025-04-13 22:38:14,232 INFO L79 Accepts]: Start accepts. Automaton has 37515 states and 202084 transitions. Word has length 45 [2025-04-13 22:38:14,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:14,232 INFO L485 AbstractCegarLoop]: Abstraction has 37515 states and 202084 transitions. [2025-04-13 22:38:14,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:14,232 INFO L278 IsEmpty]: Start isEmpty. Operand 37515 states and 202084 transitions. [2025-04-13 22:38:14,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:38:14,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:14,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:14,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:38:14,326 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:38:14,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2047122053, now seen corresponding path program 10 times [2025-04-13 22:38:14,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:14,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171548208] [2025-04-13 22:38:14,327 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:14,336 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:38:14,343 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:38:14,343 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:38:14,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:14,798 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 22:38:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:14,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171548208] [2025-04-13 22:38:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171548208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:38:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940859814] [2025-04-13 22:38:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:14,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:38:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:14,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:38:14,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:38:14,799 INFO L87 Difference]: Start difference. First operand 37515 states and 202084 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:21,328 INFO L93 Difference]: Finished difference Result 39479 states and 212401 transitions. [2025-04-13 22:38:21,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:38:21,328 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:38:21,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:21,554 INFO L225 Difference]: With dead ends: 39479 [2025-04-13 22:38:21,554 INFO L226 Difference]: Without dead ends: 39447 [2025-04-13 22:38:21,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:21,567 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:21,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 93 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:38:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39447 states. [2025-04-13 22:38:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39447 to 37613. [2025-04-13 22:38:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37613 states, 37612 states have (on average 5.390168031479315) internal successors, (202735), 37612 states have internal predecessors, (202735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37613 states to 37613 states and 202735 transitions. [2025-04-13 22:38:26,428 INFO L79 Accepts]: Start accepts. Automaton has 37613 states and 202735 transitions. Word has length 45 [2025-04-13 22:38:26,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:26,429 INFO L485 AbstractCegarLoop]: Abstraction has 37613 states and 202735 transitions. [2025-04-13 22:38:26,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:26,429 INFO L278 IsEmpty]: Start isEmpty. Operand 37613 states and 202735 transitions. [2025-04-13 22:38:26,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:38:26,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:26,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:26,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:38:26,548 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:38:26,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2139597448, now seen corresponding path program 11 times [2025-04-13 22:38:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:26,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444075995] [2025-04-13 22:38:26,549 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:26,559 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:38:26,570 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:38:26,570 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:26,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:26,894 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 22:38:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:26,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444075995] [2025-04-13 22:38:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444075995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:26,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402187652] [2025-04-13 22:38:26,895 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:26,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:26,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:26,897 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 22:38:26,898 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 22:38:26,979 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:38:27,007 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:38:27,007 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:27,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:27,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:38:27,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:27,214 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 22:38:27,289 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 22:38:27,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:38:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402187652] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:27,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:38:27,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-04-13 22:38:27,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759979890] [2025-04-13 22:38:27,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:27,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:38:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:27,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:38:27,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:38:27,290 INFO L87 Difference]: Start difference. First operand 37613 states and 202735 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:35,657 INFO L93 Difference]: Finished difference Result 48957 states and 262897 transitions. [2025-04-13 22:38:35,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:38:35,657 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:38:35,657 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:35,920 INFO L225 Difference]: With dead ends: 48957 [2025-04-13 22:38:35,920 INFO L226 Difference]: Without dead ends: 48920 [2025-04-13 22:38:35,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:38:35,936 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 150 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:35,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 87 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48920 states. [2025-04-13 22:38:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48920 to 39109. [2025-04-13 22:38:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39109 states, 39108 states have (on average 5.3903293443796665) internal successors, (210805), 39108 states have internal predecessors, (210805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39109 states to 39109 states and 210805 transitions. [2025-04-13 22:38:41,344 INFO L79 Accepts]: Start accepts. Automaton has 39109 states and 210805 transitions. Word has length 45 [2025-04-13 22:38:41,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:41,345 INFO L485 AbstractCegarLoop]: Abstraction has 39109 states and 210805 transitions. [2025-04-13 22:38:41,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:41,345 INFO L278 IsEmpty]: Start isEmpty. Operand 39109 states and 210805 transitions. [2025-04-13 22:38:41,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:38:41,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:41,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:41,451 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 22:38:41,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 22:38:41,646 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:38:41,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1242934052, now seen corresponding path program 12 times [2025-04-13 22:38:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:41,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000977138] [2025-04-13 22:38:41,647 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:41,654 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:38:41,660 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 45 statements. [2025-04-13 22:38:41,660 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:41,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:41,839 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 22:38:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:41,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000977138] [2025-04-13 22:38:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000977138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:41,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:41,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:38:41,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742967718] [2025-04-13 22:38:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:41,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:41,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:41,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:41,841 INFO L87 Difference]: Start difference. First operand 39109 states and 210805 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:53,329 INFO L93 Difference]: Finished difference Result 60452 states and 325007 transitions. [2025-04-13 22:38:53,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:38:53,330 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:38:53,330 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:53,668 INFO L225 Difference]: With dead ends: 60452 [2025-04-13 22:38:53,668 INFO L226 Difference]: Without dead ends: 60420 [2025-04-13 22:38:53,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:38:53,689 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 203 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:53,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 96 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:38:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60420 states. [2025-04-13 22:38:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60420 to 39109. [2025-04-13 22:38:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39109 states, 39108 states have (on average 5.3903293443796665) internal successors, (210805), 39108 states have internal predecessors, (210805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39109 states to 39109 states and 210805 transitions. [2025-04-13 22:38:59,401 INFO L79 Accepts]: Start accepts. Automaton has 39109 states and 210805 transitions. Word has length 45 [2025-04-13 22:38:59,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:59,401 INFO L485 AbstractCegarLoop]: Abstraction has 39109 states and 210805 transitions. [2025-04-13 22:38:59,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:38:59,401 INFO L278 IsEmpty]: Start isEmpty. Operand 39109 states and 210805 transitions. [2025-04-13 22:38:59,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:38:59,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:59,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:59,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 22:38:59,534 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:38:59,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1934310058, now seen corresponding path program 13 times [2025-04-13 22:38:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:59,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984214732] [2025-04-13 22:38:59,535 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:59,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:38:59,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:38:59,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:59,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:00,169 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 22:39:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:00,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984214732] [2025-04-13 22:39:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984214732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:39:00,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604157213] [2025-04-13 22:39:00,170 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:39:00,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:00,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:39:00,172 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 22:39:00,172 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 22:39:00,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:39:00,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:39:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:39:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:00,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:39:00,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:39:00,307 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 22:39:00,508 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 22:39:00,607 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 22:39:00,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:39:00,721 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 22:39:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604157213] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:39:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:39:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 25 [2025-04-13 22:39:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736177939] [2025-04-13 22:39:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:39:00,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:39:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:00,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:39:00,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:39:00,723 INFO L87 Difference]: Start difference. First operand 39109 states and 210805 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:09,956 INFO L93 Difference]: Finished difference Result 49120 states and 263477 transitions. [2025-04-13 22:39:09,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:39:09,956 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:39:09,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:10,278 INFO L225 Difference]: With dead ends: 49120 [2025-04-13 22:39:10,278 INFO L226 Difference]: Without dead ends: 49038 [2025-04-13 22:39:10,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:39:10,294 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 166 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:10,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 81 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:39:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49038 states. [2025-04-13 22:39:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49038 to 38925. [2025-04-13 22:39:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38925 states, 38924 states have (on average 5.39428116329257) internal successors, (209967), 38924 states have internal predecessors, (209967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 209967 transitions. [2025-04-13 22:39:15,782 INFO L79 Accepts]: Start accepts. Automaton has 38925 states and 209967 transitions. Word has length 45 [2025-04-13 22:39:15,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:15,782 INFO L485 AbstractCegarLoop]: Abstraction has 38925 states and 209967 transitions. [2025-04-13 22:39:15,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:15,782 INFO L278 IsEmpty]: Start isEmpty. Operand 38925 states and 209967 transitions. [2025-04-13 22:39:16,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:39:16,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:16,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:16,077 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 22:39:16,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:16,271 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:39:16,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1279009208, now seen corresponding path program 14 times [2025-04-13 22:39:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:16,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767200188] [2025-04-13 22:39:16,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:39:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:16,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:39:16,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 45 statements. [2025-04-13 22:39:16,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:39:16,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:16,538 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 22:39:16,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:16,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767200188] [2025-04-13 22:39:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767200188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:39:16,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:39:16,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:39:16,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092392168] [2025-04-13 22:39:16,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:39:16,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:39:16,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:16,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:39:16,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:39:16,540 INFO L87 Difference]: Start difference. First operand 38925 states and 209967 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:29,545 INFO L93 Difference]: Finished difference Result 68161 states and 366468 transitions. [2025-04-13 22:39:29,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:39:29,545 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:39:29,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:29,975 INFO L225 Difference]: With dead ends: 68161 [2025-04-13 22:39:29,975 INFO L226 Difference]: Without dead ends: 68129 [2025-04-13 22:39:29,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:39:29,999 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 261 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:29,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 78 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:39:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68129 states. [2025-04-13 22:39:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68129 to 39859. [2025-04-13 22:39:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39859 states, 39858 states have (on average 5.396557780119424) internal successors, (215096), 39858 states have internal predecessors, (215096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39859 states to 39859 states and 215096 transitions. [2025-04-13 22:39:36,379 INFO L79 Accepts]: Start accepts. Automaton has 39859 states and 215096 transitions. Word has length 45 [2025-04-13 22:39:36,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:36,379 INFO L485 AbstractCegarLoop]: Abstraction has 39859 states and 215096 transitions. [2025-04-13 22:39:36,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:36,380 INFO L278 IsEmpty]: Start isEmpty. Operand 39859 states and 215096 transitions. [2025-04-13 22:39:36,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:39:36,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:36,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:36,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:39:36,482 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:39:36,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash 639269500, now seen corresponding path program 15 times [2025-04-13 22:39:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:36,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339023514] [2025-04-13 22:39:36,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:39:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:36,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:39:36,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 45 statements. [2025-04-13 22:39:36,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:39:36,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:36,673 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 22:39:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:36,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339023514] [2025-04-13 22:39:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339023514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:39:36,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:39:36,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:39:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821012806] [2025-04-13 22:39:36,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:39:36,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:39:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:36,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:39:36,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:39:36,674 INFO L87 Difference]: Start difference. First operand 39859 states and 215096 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:51,303 INFO L93 Difference]: Finished difference Result 67623 states and 363110 transitions. [2025-04-13 22:39:51,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:39:51,303 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:39:51,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:51,897 INFO L225 Difference]: With dead ends: 67623 [2025-04-13 22:39:51,897 INFO L226 Difference]: Without dead ends: 67536 [2025-04-13 22:39:51,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:39:51,921 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 247 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:51,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 79 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:39:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67536 states. [2025-04-13 22:39:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67536 to 39219. [2025-04-13 22:39:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39219 states, 39218 states have (on average 5.395073690652252) internal successors, (211584), 39218 states have internal predecessors, (211584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39219 states to 39219 states and 211584 transitions. [2025-04-13 22:39:58,447 INFO L79 Accepts]: Start accepts. Automaton has 39219 states and 211584 transitions. Word has length 45 [2025-04-13 22:39:58,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:58,447 INFO L485 AbstractCegarLoop]: Abstraction has 39219 states and 211584 transitions. [2025-04-13 22:39:58,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:58,448 INFO L278 IsEmpty]: Start isEmpty. Operand 39219 states and 211584 transitions. [2025-04-13 22:39:58,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:39:58,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:58,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:58,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:39:58,549 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:39:58,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1269482468, now seen corresponding path program 16 times [2025-04-13 22:39:58,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:58,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282897070] [2025-04-13 22:39:58,550 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:39:58,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:58,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:39:58,563 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:39:58,563 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:39:58,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:39:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:58,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282897070] [2025-04-13 22:39:58,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282897070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:39:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:39:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:39:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379586226] [2025-04-13 22:39:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:39:58,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:39:58,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:58,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:39:58,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:39:58,791 INFO L87 Difference]: Start difference. First operand 39219 states and 211584 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:08,408 INFO L93 Difference]: Finished difference Result 43422 states and 233453 transitions. [2025-04-13 22:40:08,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:40:08,408 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:40:08,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:08,687 INFO L225 Difference]: With dead ends: 43422 [2025-04-13 22:40:08,687 INFO L226 Difference]: Without dead ends: 43385 [2025-04-13 22:40:08,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:40:08,702 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 150 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:08,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 111 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:40:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43385 states. [2025-04-13 22:40:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43385 to 39149. [2025-04-13 22:40:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39149 states, 39148 states have (on average 5.396725247777664) internal successors, (211271), 39148 states have internal predecessors, (211271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39149 states to 39149 states and 211271 transitions. [2025-04-13 22:40:14,967 INFO L79 Accepts]: Start accepts. Automaton has 39149 states and 211271 transitions. Word has length 45 [2025-04-13 22:40:14,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:14,967 INFO L485 AbstractCegarLoop]: Abstraction has 39149 states and 211271 transitions. [2025-04-13 22:40:14,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:14,967 INFO L278 IsEmpty]: Start isEmpty. Operand 39149 states and 211271 transitions. [2025-04-13 22:40:15,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:40:15,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:15,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:15,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:40:15,070 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:40:15,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1360031924, now seen corresponding path program 17 times [2025-04-13 22:40:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:15,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484762659] [2025-04-13 22:40:15,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:40:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:15,077 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:40:15,084 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:40:15,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:40:15,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:15,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 22:40:15,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:15,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484762659] [2025-04-13 22:40:15,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484762659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:15,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581235024] [2025-04-13 22:40:15,373 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:40:15,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:15,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:15,375 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 22:40:15,376 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 22:40:15,454 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:40:15,480 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:40:15,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:40:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:15,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:40:15,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:15,508 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 22:40:15,688 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 22:40:15,747 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 22:40:15,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:15,850 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 22:40:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581235024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:15,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2025-04-13 22:40:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223428352] [2025-04-13 22:40:15,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:15,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:40:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:40:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:40:15,851 INFO L87 Difference]: Start difference. First operand 39149 states and 211271 transitions. Second operand has 25 states, 24 states have (on average 5.041666666666667) internal successors, (121), 25 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:33,936 INFO L93 Difference]: Finished difference Result 74988 states and 402078 transitions. [2025-04-13 22:40:33,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:40:33,936 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.041666666666667) internal successors, (121), 25 states have internal predecessors, (121), 0 states have call successors, (0), 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 45 [2025-04-13 22:40:33,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:34,383 INFO L225 Difference]: With dead ends: 74988 [2025-04-13 22:40:34,383 INFO L226 Difference]: Without dead ends: 74951 [2025-04-13 22:40:34,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:40:34,409 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 364 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:34,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 153 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:40:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74951 states. [2025-04-13 22:40:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74951 to 41351. [2025-04-13 22:40:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41351 states, 41350 states have (on average 5.3970253929866985) internal successors, (223167), 41350 states have internal predecessors, (223167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41351 states to 41351 states and 223167 transitions. [2025-04-13 22:40:42,366 INFO L79 Accepts]: Start accepts. Automaton has 41351 states and 223167 transitions. Word has length 45 [2025-04-13 22:40:42,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:42,366 INFO L485 AbstractCegarLoop]: Abstraction has 41351 states and 223167 transitions. [2025-04-13 22:40:42,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.041666666666667) internal successors, (121), 25 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:42,366 INFO L278 IsEmpty]: Start isEmpty. Operand 41351 states and 223167 transitions. [2025-04-13 22:40:42,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:40:42,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:42,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:42,485 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 22:40:42,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:42,679 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:40:42,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -646453480, now seen corresponding path program 18 times [2025-04-13 22:40:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:42,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111985478] [2025-04-13 22:40:42,680 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:40:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:42,689 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:40:42,697 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:40:42,697 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:40:42,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:43,049 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 22:40:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:43,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111985478] [2025-04-13 22:40:43,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111985478] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:43,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951520797] [2025-04-13 22:40:43,049 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:40:43,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:43,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:43,051 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 22:40:43,052 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 22:40:43,134 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:40:43,164 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:40:43,165 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:40:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:43,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:40:43,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:43,400 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 22:40:43,463 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 22:40:43,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:43,534 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:40:43,534 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 27 treesize of output 18 [2025-04-13 22:40:43,604 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 22:40:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951520797] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:43,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2025-04-13 22:40:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571870422] [2025-04-13 22:40:43,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:43,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:40:43,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:43,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:40:43,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:40:43,606 INFO L87 Difference]: Start difference. First operand 41351 states and 223167 transitions. Second operand has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:01,447 INFO L93 Difference]: Finished difference Result 65705 states and 352586 transitions. [2025-04-13 22:41:01,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:41:01,447 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 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 45 [2025-04-13 22:41:01,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:01,848 INFO L225 Difference]: With dead ends: 65705 [2025-04-13 22:41:01,849 INFO L226 Difference]: Without dead ends: 65623 [2025-04-13 22:41:01,869 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:41:01,870 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 764 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:01,870 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 251 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2808 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:41:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65623 states. [2025-04-13 22:41:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65623 to 40703. [2025-04-13 22:41:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40703 states, 40702 states have (on average 5.395877352464252) internal successors, (219623), 40702 states have internal predecessors, (219623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40703 states to 40703 states and 219623 transitions. [2025-04-13 22:41:08,898 INFO L79 Accepts]: Start accepts. Automaton has 40703 states and 219623 transitions. Word has length 45 [2025-04-13 22:41:08,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:08,899 INFO L485 AbstractCegarLoop]: Abstraction has 40703 states and 219623 transitions. [2025-04-13 22:41:08,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:08,899 INFO L278 IsEmpty]: Start isEmpty. Operand 40703 states and 219623 transitions. [2025-04-13 22:41:09,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:41:09,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:09,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:09,007 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 22:41:09,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:09,202 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:41:09,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash -165927800, now seen corresponding path program 19 times [2025-04-13 22:41:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:09,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139495085] [2025-04-13 22:41:09,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:41:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:09,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:41:09,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:41:09,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:09,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:10,046 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 22:41:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:10,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139495085] [2025-04-13 22:41:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139495085] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:10,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992947060] [2025-04-13 22:41:10,046 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:41:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:10,048 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 22:41:10,052 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 22:41:10,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:41:10,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:41:10,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:10,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:10,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:41:10,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:10,178 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 22:41:10,368 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 22:41:10,433 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 22:41:10,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:10,561 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 22:41:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992947060] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:10,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2025-04-13 22:41:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796998583] [2025-04-13 22:41:10,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:10,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:41:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:10,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:41:10,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:41:10,562 INFO L87 Difference]: Start difference. First operand 40703 states and 219623 transitions. Second operand has 26 states, 25 states have (on average 4.8) internal successors, (120), 26 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:29,310 INFO L93 Difference]: Finished difference Result 66275 states and 355715 transitions. [2025-04-13 22:41:29,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:41:29,311 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.8) internal successors, (120), 26 states have internal predecessors, (120), 0 states have call successors, (0), 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 45 [2025-04-13 22:41:29,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:29,742 INFO L225 Difference]: With dead ends: 66275 [2025-04-13 22:41:29,742 INFO L226 Difference]: Without dead ends: 66238 [2025-04-13 22:41:29,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:41:29,765 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 304 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:29,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 243 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:41:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66238 states. [2025-04-13 22:41:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66238 to 40409. [2025-04-13 22:41:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40409 states, 40408 states have (on average 5.39511977826173) internal successors, (218006), 40408 states have internal predecessors, (218006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40409 states to 40409 states and 218006 transitions. [2025-04-13 22:41:37,833 INFO L79 Accepts]: Start accepts. Automaton has 40409 states and 218006 transitions. Word has length 45 [2025-04-13 22:41:37,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:37,833 INFO L485 AbstractCegarLoop]: Abstraction has 40409 states and 218006 transitions. [2025-04-13 22:41:37,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.8) internal successors, (120), 26 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:37,833 INFO L278 IsEmpty]: Start isEmpty. Operand 40409 states and 218006 transitions. [2025-04-13 22:41:37,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:41:37,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:37,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:37,943 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 22:41:38,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 22:41:38,138 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:41:38,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1883934150, now seen corresponding path program 20 times [2025-04-13 22:41:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:38,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461415391] [2025-04-13 22:41:38,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:38,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:41:38,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:41:38,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:38,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:38,538 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 22:41:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:38,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461415391] [2025-04-13 22:41:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461415391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:38,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045789022] [2025-04-13 22:41:38,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:38,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:38,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:38,540 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 22:41:38,541 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 22:41:38,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:41:38,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:41:38,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:38,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:38,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:41:38,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:38,969 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 22:41:38,993 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 22:41:38,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:39,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:39,065 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 27 treesize of output 18 [2025-04-13 22:41:39,121 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 22:41:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045789022] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:39,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-04-13 22:41:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736295226] [2025-04-13 22:41:39,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:39,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:41:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:39,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:41:39,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:41:39,123 INFO L87 Difference]: Start difference. First operand 40409 states and 218006 transitions. Second operand has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:02,704 INFO L93 Difference]: Finished difference Result 75241 states and 404383 transitions. [2025-04-13 22:42:02,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:42:02,704 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 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 45 [2025-04-13 22:42:02,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:03,180 INFO L225 Difference]: With dead ends: 75241 [2025-04-13 22:42:03,181 INFO L226 Difference]: Without dead ends: 75204 [2025-04-13 22:42:03,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:42:03,208 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 831 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:03,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 311 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:42:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75204 states. [2025-04-13 22:42:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75204 to 40558. [2025-04-13 22:42:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40558 states, 40557 states have (on average 5.387898513203639) internal successors, (218517), 40557 states have internal predecessors, (218517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40558 states to 40558 states and 218517 transitions. [2025-04-13 22:42:11,954 INFO L79 Accepts]: Start accepts. Automaton has 40558 states and 218517 transitions. Word has length 45 [2025-04-13 22:42:11,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:11,954 INFO L485 AbstractCegarLoop]: Abstraction has 40558 states and 218517 transitions. [2025-04-13 22:42:11,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:11,955 INFO L278 IsEmpty]: Start isEmpty. Operand 40558 states and 218517 transitions. [2025-04-13 22:42:12,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:42:12,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:12,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:12,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 22:42:12,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 22:42:12,497 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:42:12,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2136771121, now seen corresponding path program 11 times [2025-04-13 22:42:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:12,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280390345] [2025-04-13 22:42:12,497 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:42:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:12,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:42:12,517 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:42:12,519 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:12,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:12,976 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 22:42:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:12,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280390345] [2025-04-13 22:42:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280390345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:12,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223557172] [2025-04-13 22:42:12,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:42:12,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:12,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:12,978 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 22:42:12,979 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 22:42:13,070 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:42:13,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:42:13,100 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:13,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:13,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:42:13,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:13,127 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 22:42:13,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:42:13,389 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 22:42:13,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:13,516 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 22:42:13,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223557172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:13,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:13,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2025-04-13 22:42:13,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096712992] [2025-04-13 22:42:13,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:13,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:42:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:13,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:42:13,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:42:13,518 INFO L87 Difference]: Start difference. First operand 40558 states and 218517 transitions. Second operand has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:36,361 INFO L93 Difference]: Finished difference Result 74857 states and 401895 transitions. [2025-04-13 22:42:36,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:42:36,362 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 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 45 [2025-04-13 22:42:36,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:36,837 INFO L225 Difference]: With dead ends: 74857 [2025-04-13 22:42:36,837 INFO L226 Difference]: Without dead ends: 74820 [2025-04-13 22:42:36,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:42:36,864 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 523 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:36,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 163 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:42:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74820 states. [2025-04-13 22:42:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74820 to 42642. [2025-04-13 22:42:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42642 states, 42641 states have (on average 5.392697169390962) internal successors, (229950), 42641 states have internal predecessors, (229950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42642 states to 42642 states and 229950 transitions. [2025-04-13 22:42:46,113 INFO L79 Accepts]: Start accepts. Automaton has 42642 states and 229950 transitions. Word has length 45 [2025-04-13 22:42:46,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:46,113 INFO L485 AbstractCegarLoop]: Abstraction has 42642 states and 229950 transitions. [2025-04-13 22:42:46,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.173913043478261) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:46,113 INFO L278 IsEmpty]: Start isEmpty. Operand 42642 states and 229950 transitions. [2025-04-13 22:42:46,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:42:46,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:46,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:46,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 22:42:46,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 22:42:46,425 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:42:46,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash -145757233, now seen corresponding path program 12 times [2025-04-13 22:42:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:46,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834236510] [2025-04-13 22:42:46,425 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:42:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:46,654 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:42:46,661 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:42:46,661 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:42:46,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:46,853 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 22:42:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:46,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834236510] [2025-04-13 22:42:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834236510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:46,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089528882] [2025-04-13 22:42:46,853 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:42:46,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:46,855 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 22:42:46,856 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 22:42:46,939 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:42:46,964 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:42:46,964 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:42:46,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:46,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:42:46,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:47,230 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 22:42:47,273 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 22:42:47,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:47,349 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:42:47,349 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 27 treesize of output 18 [2025-04-13 22:42:47,441 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 22:42:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089528882] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:47,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-04-13 22:42:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263432774] [2025-04-13 22:42:47,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:47,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:42:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:47,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:42:47,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:42:47,443 INFO L87 Difference]: Start difference. First operand 42642 states and 229950 transitions. Second operand has 22 states, 21 states have (on average 5.714285714285714) internal successors, (120), 22 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:43:17,254 INFO L93 Difference]: Finished difference Result 86408 states and 463500 transitions. [2025-04-13 22:43:17,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:43:17,254 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.714285714285714) internal successors, (120), 22 states have internal predecessors, (120), 0 states have call successors, (0), 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 45 [2025-04-13 22:43:17,254 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:43:17,794 INFO L225 Difference]: With dead ends: 86408 [2025-04-13 22:43:17,794 INFO L226 Difference]: Without dead ends: 86326 [2025-04-13 22:43:17,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:43:17,827 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 585 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 3454 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:43:17,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 273 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3454 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:43:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86326 states. [2025-04-13 22:43:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86326 to 44320. [2025-04-13 22:43:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44320 states, 44319 states have (on average 5.416638462059162) internal successors, (240060), 44319 states have internal predecessors, (240060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44320 states to 44320 states and 240060 transitions. [2025-04-13 22:43:27,907 INFO L79 Accepts]: Start accepts. Automaton has 44320 states and 240060 transitions. Word has length 45 [2025-04-13 22:43:27,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:43:27,908 INFO L485 AbstractCegarLoop]: Abstraction has 44320 states and 240060 transitions. [2025-04-13 22:43:27,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.714285714285714) internal successors, (120), 22 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:27,908 INFO L278 IsEmpty]: Start isEmpty. Operand 44320 states and 240060 transitions. [2025-04-13 22:43:28,029 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:43:28,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:43:28,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:43:28,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 22:43:28,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 22:43:28,230 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:43:28,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:43:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1932592749, now seen corresponding path program 13 times [2025-04-13 22:43:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:43:28,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138141392] [2025-04-13 22:43:28,231 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:43:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:43:28,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:43:28,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:43:28,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:43:28,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:28,653 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 22:43:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:43:28,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138141392] [2025-04-13 22:43:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138141392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:43:28,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229754632] [2025-04-13 22:43:28,654 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:43:28,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:43:28,655 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 22:43:28,656 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 22:43:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:43:28,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:43:28,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:43:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:28,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:43:28,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:43:28,792 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 22:43:29,013 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 22:43:29,070 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 22:43:29,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:43:29,477 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 22:43:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229754632] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:43:29,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:43:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2025-04-13 22:43:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991907024] [2025-04-13 22:43:29,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:43:29,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:43:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:43:29,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:43:29,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:43:29,479 INFO L87 Difference]: Start difference. First operand 44320 states and 240060 transitions. Second operand has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:43:52,780 INFO L93 Difference]: Finished difference Result 69024 states and 371831 transitions. [2025-04-13 22:43:52,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:43:52,780 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 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 45 [2025-04-13 22:43:52,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:43:53,216 INFO L225 Difference]: With dead ends: 69024 [2025-04-13 22:43:53,216 INFO L226 Difference]: Without dead ends: 68987 [2025-04-13 22:43:53,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:43:53,240 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 412 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:43:53,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 205 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:43:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68987 states. [2025-04-13 22:44:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68987 to 44222. [2025-04-13 22:44:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44222 states, 44221 states have (on average 5.418036679405712) internal successors, (239591), 44221 states have internal predecessors, (239591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44222 states to 44222 states and 239591 transitions. [2025-04-13 22:44:03,985 INFO L79 Accepts]: Start accepts. Automaton has 44222 states and 239591 transitions. Word has length 45 [2025-04-13 22:44:03,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:03,985 INFO L485 AbstractCegarLoop]: Abstraction has 44222 states and 239591 transitions. [2025-04-13 22:44:03,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 26 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:03,985 INFO L278 IsEmpty]: Start isEmpty. Operand 44222 states and 239591 transitions. [2025-04-13 22:44:04,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:44:04,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:04,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:04,106 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 22:44:04,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:04,300 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:44:04,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 329549811, now seen corresponding path program 14 times [2025-04-13 22:44:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:04,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293123023] [2025-04-13 22:44:04,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:44:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:04,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:44:04,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:44:04,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:44:04,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:04,694 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 22:44:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:04,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293123023] [2025-04-13 22:44:04,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293123023] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:44:04,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729389874] [2025-04-13 22:44:04,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:44:04,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:44:04,697 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:44:04,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 22:44:04,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:44:04,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:44:04,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:44:04,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:04,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:44:04,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:44:05,655 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 22:44:05,681 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 22:44:05,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:44:05,763 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:44:05,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2025-04-13 22:44:05,830 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 22:44:05,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729389874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:44:05,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:44:05,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2025-04-13 22:44:05,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336469204] [2025-04-13 22:44:05,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:44:05,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:44:05,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:05,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:44:05,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:44:05,831 INFO L87 Difference]: Start difference. First operand 44222 states and 239591 transitions. Second operand has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:29,824 INFO L93 Difference]: Finished difference Result 58745 states and 316433 transitions. [2025-04-13 22:44:29,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:44:29,824 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 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 45 [2025-04-13 22:44:29,824 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:30,212 INFO L225 Difference]: With dead ends: 58745 [2025-04-13 22:44:30,212 INFO L226 Difference]: Without dead ends: 58708 [2025-04-13 22:44:30,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:44:30,234 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 563 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:30,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 308 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3515 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:44:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58708 states. [2025-04-13 22:44:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58708 to 43802. [2025-04-13 22:44:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43802 states, 43801 states have (on average 5.425583890778749) internal successors, (237646), 43801 states have internal predecessors, (237646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43802 states to 43802 states and 237646 transitions. [2025-04-13 22:44:40,446 INFO L79 Accepts]: Start accepts. Automaton has 43802 states and 237646 transitions. Word has length 45 [2025-04-13 22:44:40,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:40,446 INFO L485 AbstractCegarLoop]: Abstraction has 43802 states and 237646 transitions. [2025-04-13 22:44:40,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:40,447 INFO L278 IsEmpty]: Start isEmpty. Operand 43802 states and 237646 transitions. [2025-04-13 22:44:40,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:44:40,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:40,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:40,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 22:44:40,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:40,770 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-13 22:44:40,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1773489205, now seen corresponding path program 15 times [2025-04-13 22:44:40,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:40,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534688450] [2025-04-13 22:44:40,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:44:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:40,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:44:40,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 45 statements. [2025-04-13 22:44:40,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:44:40,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:40,958 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 22:44:40,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:40,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534688450] [2025-04-13 22:44:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534688450] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:44:40,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:44:40,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:44:40,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865984610] [2025-04-13 22:44:40,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:44:40,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:44:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:40,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:44:40,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:44:40,960 INFO L87 Difference]: Start difference. First operand 43802 states and 237646 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:06,097 INFO L93 Difference]: Finished difference Result 70714 states and 381414 transitions. [2025-04-13 22:45:06,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:45:06,097 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-04-13 22:45:06,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:06,510 INFO L225 Difference]: With dead ends: 70714 [2025-04-13 22:45:06,510 INFO L226 Difference]: Without dead ends: 70677 [2025-04-13 22:45:06,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:45:06,535 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 238 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:06,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 77 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:45:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70677 states. Received shutdown request... [2025-04-13 22:45:15,654 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 22:45:16,662 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 [2025-04-13 22:45:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70677 to 45192. [2025-04-13 22:45:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45192 states, 45191 states have (on average 5.436856896284659) internal successors, (245697), 45191 states have internal predecessors, (245697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:18,005 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-04-13 22:45:18,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 22:45:18,009 WARN L610 AbstractCegarLoop]: Verification canceled: while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). [2025-04-13 22:45:18,011 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork5Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork5Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork2Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2025-04-13 22:45:18,012 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork2Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2025-04-13 22:45:18,021 INFO L422 BasicCegarLoop]: Path program histogram: [20, 15, 3, 2, 2, 1] [2025-04-13 22:45:18,028 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:45:18,028 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:45:18,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:45:18 BasicIcfg [2025-04-13 22:45:18,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:45:18,032 INFO L158 Benchmark]: Toolchain (without parser) took 685886.34ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 99.1MB in the beginning and 323.6MB in the end (delta: -224.6MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-04-13 22:45:18,032 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:45:18,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.76ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 82.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:45:18,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.42ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 79.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:45:18,033 INFO L158 Benchmark]: Boogie Preprocessor took 42.32ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 77.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:45:18,033 INFO L158 Benchmark]: IcfgBuilder took 956.43ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 81.6MB in the end (delta: -4.3MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2025-04-13 22:45:18,033 INFO L158 Benchmark]: TraceAbstraction took 684553.43ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 81.6MB in the beginning and 323.6MB in the end (delta: -242.0MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-04-13 22:45:18,033 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.76ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 82.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.42ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 79.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.32ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 77.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 956.43ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 81.6MB in the end (delta: -4.3MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. * TraceAbstraction took 684553.43ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 81.6MB in the beginning and 323.6MB in the end (delta: -242.0MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 166]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 105 locations, 129 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 684.4s, OverallIterations: 43, TraceHistogramMax: 2, PathProgramHistogramMax: 20, EmptinessCheckTime: 4.8s, AutomataDifference: 434.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15148 SdHoareTripleChecker+Valid, 28.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15148 mSDsluCounter, 6606 SdHoareTripleChecker+Invalid, 23.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6049 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75771 IncrementalHoareTripleChecker+Invalid, 75972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 557 mSDtfsCounter, 75771 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3098 GetRequests, 2143 SyntacticMatches, 0 SemanticMatches, 955 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4748 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44320occurred in iteration=40, InterpolantAutomatonStates: 608, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 201.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 849858 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 3190 NumberOfCodeBlocks, 3175 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 4295 ConstructedInterpolants, 0 QuantifiedInterpolants, 58559 SizeOfPredicates, 485 NumberOfNonLiveVariables, 10841 ConjunctsInSsa, 1012 ConjunctsInUnsatCore, 99 InterpolantComputations, 19 PerfectInterpolantSequences, 185/373 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown