/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:54:56,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:54:56,795 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:54:56,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:54:56,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:54:56,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:54:56,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:54:56,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:54:56,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:54:56,820 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:54:56,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:54:56,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:54:56,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:54:56,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:54:56,820 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:54:56,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:54:56,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:54:56,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:54:56,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:54:56,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:54:56,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:54:56,822 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:54:57,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:54:57,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:54:57,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:54:57,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:54:57,038 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:54:57,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2025-04-13 22:54:58,326 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d343a1ec/1287f7e402884374b11019ff557a7629/FLAG6f26965d0 [2025-04-13 22:54:58,512 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:54:58,513 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2025-04-13 22:54:58,519 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d343a1ec/1287f7e402884374b11019ff557a7629/FLAG6f26965d0 [2025-04-13 22:54:59,377 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d343a1ec/1287f7e402884374b11019ff557a7629 [2025-04-13 22:54:59,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:54:59,380 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:54:59,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:54:59,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:54:59,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:54:59,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e5332f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59, skipping insertion in model container [2025-04-13 22:54:59,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:54:59,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c[4270,4283] [2025-04-13 22:54:59,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:54:59,610 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:54:59,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c[4270,4283] [2025-04-13 22:54:59,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:54:59,666 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:54:59,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59 WrapperNode [2025-04-13 22:54:59,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:54:59,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:54:59,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:54:59,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:54:59,672 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:54:59" (1/1) ... [2025-04-13 22:54:59,681 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:54:59" (1/1) ... [2025-04-13 22:54:59,699 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 278 [2025-04-13 22:54:59,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:54:59,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:54:59,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:54:59,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:54:59,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,727 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:54:59,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:54:59,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:54:59,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:54:59,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:54:59,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (1/1) ... [2025-04-13 22:54:59,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:54:59,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:54:59,778 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:54:59,781 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:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:54:59,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:54:59,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:54:59,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:54:59,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:54:59,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:54:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:54:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:54:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:54:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:54:59,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:54:59,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:54:59,802 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:54:59,898 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:54:59,899 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:55:00,232 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:55:00,233 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:55:00,233 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:55:00,520 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:55:00,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:55:00 BoogieIcfgContainer [2025-04-13 22:55:00,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:55:00,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:55:00,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:55:00,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:55:00,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:54:59" (1/3) ... [2025-04-13 22:55:00,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f98876c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:55:00, skipping insertion in model container [2025-04-13 22:55:00,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:54:59" (2/3) ... [2025-04-13 22:55:00,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f98876c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:55:00, skipping insertion in model container [2025-04-13 22:55:00,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:55:00" (3/3) ... [2025-04-13 22:55:00,527 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2025-04-13 22:55:00,536 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:55:00,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 44 locations, 45 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:55:00,537 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:55:00,588 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 22:55:00,611 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 126 flow [2025-04-13 22:55:00,829 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 0 states have 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:55:00,845 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:55:00,852 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;@d91075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:55:00,852 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 22:55:00,866 INFO L278 IsEmpty]: Start isEmpty. Operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 0 states have 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:55:00,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:55:00,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:00,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:55:00,900 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:00,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1920611613, now seen corresponding path program 1 times [2025-04-13 22:55:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:00,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200088269] [2025-04-13 22:55:00,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:00,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:55:01,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:55:01,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:01,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:01,191 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:55:01,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:01,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200088269] [2025-04-13 22:55:01,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200088269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:01,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:01,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 22:55:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390143802] [2025-04-13 22:55:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:01,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:55:01,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:01,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:55:01,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:01,229 INFO L87 Difference]: Start difference. First operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:01,539 INFO L93 Difference]: Finished difference Result 7055 states and 30786 transitions. [2025-04-13 22:55:01,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:55:01,541 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:55:01,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:01,619 INFO L225 Difference]: With dead ends: 7055 [2025-04-13 22:55:01,621 INFO L226 Difference]: Without dead ends: 6946 [2025-04-13 22:55:01,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:01,630 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:01,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 16 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-04-13 22:55:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5893. [2025-04-13 22:55:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 5892 states have (on average 4.356415478615071) internal successors, (25668), 5892 states have internal predecessors, (25668), 0 states have call successors, (0), 0 states have 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:55:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 25668 transitions. [2025-04-13 22:55:02,031 INFO L79 Accepts]: Start accepts. Automaton has 5893 states and 25668 transitions. Word has length 28 [2025-04-13 22:55:02,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:02,031 INFO L485 AbstractCegarLoop]: Abstraction has 5893 states and 25668 transitions. [2025-04-13 22:55:02,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:02,032 INFO L278 IsEmpty]: Start isEmpty. Operand 5893 states and 25668 transitions. [2025-04-13 22:55:02,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:55:02,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:02,054 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] [2025-04-13 22:55:02,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:55:02,054 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:02,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:02,055 INFO L85 PathProgramCache]: Analyzing trace with hash -523066841, now seen corresponding path program 1 times [2025-04-13 22:55:02,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:02,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037753414] [2025-04-13 22:55:02,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:02,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:55:02,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:55:02,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:02,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:02,243 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:55:02,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:02,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037753414] [2025-04-13 22:55:02,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037753414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:02,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:02,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:55:02,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920082100] [2025-04-13 22:55:02,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:02,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:55:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:02,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:55:02,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:02,245 INFO L87 Difference]: Start difference. First operand 5893 states and 25668 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:55:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:02,611 INFO L93 Difference]: Finished difference Result 10590 states and 46116 transitions. [2025-04-13 22:55:02,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:55:02,611 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:55:02,611 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:02,671 INFO L225 Difference]: With dead ends: 10590 [2025-04-13 22:55:02,671 INFO L226 Difference]: Without dead ends: 7434 [2025-04-13 22:55:02,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:02,682 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:02,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 15 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2025-04-13 22:55:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 7033. [2025-04-13 22:55:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7033 states, 7032 states have (on average 4.324800910125142) internal successors, (30412), 7032 states have internal predecessors, (30412), 0 states have call successors, (0), 0 states have 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:55:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7033 states to 7033 states and 30412 transitions. [2025-04-13 22:55:02,956 INFO L79 Accepts]: Start accepts. Automaton has 7033 states and 30412 transitions. Word has length 31 [2025-04-13 22:55:02,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:02,957 INFO L485 AbstractCegarLoop]: Abstraction has 7033 states and 30412 transitions. [2025-04-13 22:55:02,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:55:02,958 INFO L278 IsEmpty]: Start isEmpty. Operand 7033 states and 30412 transitions. [2025-04-13 22:55:02,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:55:02,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:02,974 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] [2025-04-13 22:55:02,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:55:02,975 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:02,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash 577866481, now seen corresponding path program 1 times [2025-04-13 22:55:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:02,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560533341] [2025-04-13 22:55:02,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:02,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:55:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:55:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:55:03,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:03,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560533341] [2025-04-13 22:55:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560533341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:03,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:55:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012607093] [2025-04-13 22:55:03,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:03,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:55:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:03,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:55:03,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:03,084 INFO L87 Difference]: Start difference. First operand 7033 states and 30412 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:55:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:03,363 INFO L93 Difference]: Finished difference Result 12067 states and 52236 transitions. [2025-04-13 22:55:03,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:55:03,364 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:55:03,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:03,472 INFO L225 Difference]: With dead ends: 12067 [2025-04-13 22:55:03,473 INFO L226 Difference]: Without dead ends: 8687 [2025-04-13 22:55:03,479 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:55:03,481 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:03,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8687 states. [2025-04-13 22:55:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8687 to 8350. [2025-04-13 22:55:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8350 states, 8349 states have (on average 4.27596119295724) internal successors, (35700), 8349 states have internal predecessors, (35700), 0 states have call successors, (0), 0 states have 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:55:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8350 states to 8350 states and 35700 transitions. [2025-04-13 22:55:03,898 INFO L79 Accepts]: Start accepts. Automaton has 8350 states and 35700 transitions. Word has length 31 [2025-04-13 22:55:03,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:03,898 INFO L485 AbstractCegarLoop]: Abstraction has 8350 states and 35700 transitions. [2025-04-13 22:55:03,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:55:03,899 INFO L278 IsEmpty]: Start isEmpty. Operand 8350 states and 35700 transitions. [2025-04-13 22:55:03,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:03,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:03,922 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] [2025-04-13 22:55:03,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:55:03,923 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:03,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1017715940, now seen corresponding path program 1 times [2025-04-13 22:55:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:03,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070067198] [2025-04-13 22:55:03,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:03,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:55:03,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:55:04,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:04,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070067198] [2025-04-13 22:55:04,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070067198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:04,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:04,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:55:04,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697143603] [2025-04-13 22:55:04,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:04,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:55:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:04,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:55:04,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:55:04,115 INFO L87 Difference]: Start difference. First operand 8350 states and 35700 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:55:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:04,545 INFO L93 Difference]: Finished difference Result 17127 states and 72789 transitions. [2025-04-13 22:55:04,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:55:04,546 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:04,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:04,601 INFO L225 Difference]: With dead ends: 17127 [2025-04-13 22:55:04,601 INFO L226 Difference]: Without dead ends: 10595 [2025-04-13 22:55:04,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:55:04,619 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:04,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10595 states. [2025-04-13 22:55:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10595 to 9853. [2025-04-13 22:55:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9853 states, 9852 states have (on average 4.2422858302882664) internal successors, (41795), 9852 states have internal predecessors, (41795), 0 states have call successors, (0), 0 states have 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:55:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9853 states to 9853 states and 41795 transitions. [2025-04-13 22:55:04,993 INFO L79 Accepts]: Start accepts. Automaton has 9853 states and 41795 transitions. Word has length 35 [2025-04-13 22:55:04,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:04,993 INFO L485 AbstractCegarLoop]: Abstraction has 9853 states and 41795 transitions. [2025-04-13 22:55:04,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:55:04,994 INFO L278 IsEmpty]: Start isEmpty. Operand 9853 states and 41795 transitions. [2025-04-13 22:55:05,017 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:55:05,017 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:05,017 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] [2025-04-13 22:55:05,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:55:05,018 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:05,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1131509624, now seen corresponding path program 1 times [2025-04-13 22:55:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:05,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985674988] [2025-04-13 22:55:05,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:05,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:55:05,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:55:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:05,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:05,132 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:55:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:05,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985674988] [2025-04-13 22:55:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985674988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:05,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:55:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867430989] [2025-04-13 22:55:05,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:05,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:55:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:05,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:55:05,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:55:05,133 INFO L87 Difference]: Start difference. First operand 9853 states and 41795 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:55:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:05,522 INFO L93 Difference]: Finished difference Result 20040 states and 84712 transitions. [2025-04-13 22:55:05,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:55:05,523 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:55:05,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:05,596 INFO L225 Difference]: With dead ends: 20040 [2025-04-13 22:55:05,596 INFO L226 Difference]: Without dead ends: 12132 [2025-04-13 22:55:05,617 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:55:05,618 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:05,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12132 states. [2025-04-13 22:55:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12132 to 11542. [2025-04-13 22:55:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11542 states, 11541 states have (on average 4.212633220691448) internal successors, (48618), 11541 states have internal predecessors, (48618), 0 states have call successors, (0), 0 states have 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:55:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11542 states to 11542 states and 48618 transitions. [2025-04-13 22:55:06,236 INFO L79 Accepts]: Start accepts. Automaton has 11542 states and 48618 transitions. Word has length 35 [2025-04-13 22:55:06,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:06,236 INFO L485 AbstractCegarLoop]: Abstraction has 11542 states and 48618 transitions. [2025-04-13 22:55:06,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:55:06,237 INFO L278 IsEmpty]: Start isEmpty. Operand 11542 states and 48618 transitions. [2025-04-13 22:55:06,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:06,272 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] [2025-04-13 22:55:06,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:55:06,272 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:06,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash -808592798, now seen corresponding path program 1 times [2025-04-13 22:55:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:06,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285655516] [2025-04-13 22:55:06,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:06,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:55:06,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:06,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:06,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:06,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285655516] [2025-04-13 22:55:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285655516] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:06,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202620577] [2025-04-13 22:55:06,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:55:06,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:06,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:06,703 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:55:06,705 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:55:06,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:55:06,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:06,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:06,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:55:06,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:55:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:07,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:55:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202620577] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:07,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:55:07,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 6] total 18 [2025-04-13 22:55:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22584337] [2025-04-13 22:55:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:07,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:55:07,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:07,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:55:07,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:55:07,248 INFO L87 Difference]: Start difference. First operand 11542 states and 48618 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:08,665 INFO L93 Difference]: Finished difference Result 18421 states and 75849 transitions. [2025-04-13 22:55:08,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:55:08,666 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:08,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:08,759 INFO L225 Difference]: With dead ends: 18421 [2025-04-13 22:55:08,759 INFO L226 Difference]: Without dead ends: 16003 [2025-04-13 22:55:08,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:55:08,772 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 240 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:08,772 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 129 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:55:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16003 states. [2025-04-13 22:55:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16003 to 11979. [2025-04-13 22:55:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11979 states, 11978 states have (on average 4.244531641342461) internal successors, (50841), 11978 states have internal predecessors, (50841), 0 states have call successors, (0), 0 states have 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:55:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11979 states to 11979 states and 50841 transitions. [2025-04-13 22:55:09,410 INFO L79 Accepts]: Start accepts. Automaton has 11979 states and 50841 transitions. Word has length 36 [2025-04-13 22:55:09,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:09,410 INFO L485 AbstractCegarLoop]: Abstraction has 11979 states and 50841 transitions. [2025-04-13 22:55:09,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:09,410 INFO L278 IsEmpty]: Start isEmpty. Operand 11979 states and 50841 transitions. [2025-04-13 22:55:09,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:09,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:09,437 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] [2025-04-13 22:55:09,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:55:09,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 22:55:09,642 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:09,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash -87403474, now seen corresponding path program 2 times [2025-04-13 22:55:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:09,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355295059] [2025-04-13 22:55:09,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:09,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:09,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:09,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:55:09,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:10,007 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:55:10,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:10,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355295059] [2025-04-13 22:55:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355295059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:10,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:10,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:55:10,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196007845] [2025-04-13 22:55:10,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:10,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:55:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:10,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:55:10,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:55:10,008 INFO L87 Difference]: Start difference. First operand 11979 states and 50841 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:11,367 INFO L93 Difference]: Finished difference Result 19454 states and 80497 transitions. [2025-04-13 22:55:11,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:55:11,367 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:11,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:11,466 INFO L225 Difference]: With dead ends: 19454 [2025-04-13 22:55:11,466 INFO L226 Difference]: Without dead ends: 18510 [2025-04-13 22:55:11,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:55:11,478 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 215 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:11,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 142 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:55:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18510 states. [2025-04-13 22:55:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18510 to 12507. [2025-04-13 22:55:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12507 states, 12506 states have (on average 4.239485047177355) internal successors, (53019), 12506 states have internal predecessors, (53019), 0 states have call successors, (0), 0 states have 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:55:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12507 states to 12507 states and 53019 transitions. [2025-04-13 22:55:12,757 INFO L79 Accepts]: Start accepts. Automaton has 12507 states and 53019 transitions. Word has length 36 [2025-04-13 22:55:12,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:12,758 INFO L485 AbstractCegarLoop]: Abstraction has 12507 states and 53019 transitions. [2025-04-13 22:55:12,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:12,758 INFO L278 IsEmpty]: Start isEmpty. Operand 12507 states and 53019 transitions. [2025-04-13 22:55:12,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:12,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:12,797 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] [2025-04-13 22:55:12,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:55:12,798 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:12,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1574690312, now seen corresponding path program 3 times [2025-04-13 22:55:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:12,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962714627] [2025-04-13 22:55:12,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:55:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:12,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:12,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:12,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:55:12,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:13,134 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:55:13,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:13,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962714627] [2025-04-13 22:55:13,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962714627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:13,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:13,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:13,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86877772] [2025-04-13 22:55:13,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:13,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:13,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:13,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:13,136 INFO L87 Difference]: Start difference. First operand 12507 states and 53019 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:14,893 INFO L93 Difference]: Finished difference Result 22869 states and 94748 transitions. [2025-04-13 22:55:14,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:55:14,893 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:14,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:14,988 INFO L225 Difference]: With dead ends: 22869 [2025-04-13 22:55:14,988 INFO L226 Difference]: Without dead ends: 21378 [2025-04-13 22:55:14,996 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:55:14,996 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 169 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:14,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 94 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:55:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21378 states. [2025-04-13 22:55:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21378 to 12695. [2025-04-13 22:55:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12695 states, 12694 states have (on average 4.260989443831732) internal successors, (54089), 12694 states have internal predecessors, (54089), 0 states have call successors, (0), 0 states have 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:55:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12695 states to 12695 states and 54089 transitions. [2025-04-13 22:55:15,821 INFO L79 Accepts]: Start accepts. Automaton has 12695 states and 54089 transitions. Word has length 36 [2025-04-13 22:55:15,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:15,821 INFO L485 AbstractCegarLoop]: Abstraction has 12695 states and 54089 transitions. [2025-04-13 22:55:15,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:15,821 INFO L278 IsEmpty]: Start isEmpty. Operand 12695 states and 54089 transitions. [2025-04-13 22:55:15,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:15,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:15,847 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] [2025-04-13 22:55:15,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:55:15,847 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:15,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -528871640, now seen corresponding path program 4 times [2025-04-13 22:55:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:15,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745779068] [2025-04-13 22:55:15,847 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:55:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:15,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:15,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:15,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:55:15,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:16,002 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:55:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:16,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745779068] [2025-04-13 22:55:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745779068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:16,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483262096] [2025-04-13 22:55:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:16,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:55:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:16,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:55:16,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:55:16,004 INFO L87 Difference]: Start difference. First operand 12695 states and 54089 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:17,312 INFO L93 Difference]: Finished difference Result 17590 states and 75453 transitions. [2025-04-13 22:55:17,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:55:17,313 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:17,313 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:17,381 INFO L225 Difference]: With dead ends: 17590 [2025-04-13 22:55:17,381 INFO L226 Difference]: Without dead ends: 16356 [2025-04-13 22:55:17,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:55:17,387 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:17,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 70 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16356 states. [2025-04-13 22:55:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16356 to 13562. [2025-04-13 22:55:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13562 states, 13561 states have (on average 4.276823243123664) internal successors, (57998), 13561 states have internal predecessors, (57998), 0 states have call successors, (0), 0 states have 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:55:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13562 states to 13562 states and 57998 transitions. [2025-04-13 22:55:18,471 INFO L79 Accepts]: Start accepts. Automaton has 13562 states and 57998 transitions. Word has length 36 [2025-04-13 22:55:18,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:18,471 INFO L485 AbstractCegarLoop]: Abstraction has 13562 states and 57998 transitions. [2025-04-13 22:55:18,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:18,471 INFO L278 IsEmpty]: Start isEmpty. Operand 13562 states and 57998 transitions. [2025-04-13 22:55:18,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:18,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:18,498 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] [2025-04-13 22:55:18,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:55:18,499 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:18,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1960708898, now seen corresponding path program 5 times [2025-04-13 22:55:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:18,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564330407] [2025-04-13 22:55:18,499 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:55:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:18,505 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:18,516 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:18,517 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:55:18,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:18,737 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:55:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:18,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564330407] [2025-04-13 22:55:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564330407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032827709] [2025-04-13 22:55:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:18,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:18,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:18,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:18,738 INFO L87 Difference]: Start difference. First operand 13562 states and 57998 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:20,603 INFO L93 Difference]: Finished difference Result 16822 states and 69909 transitions. [2025-04-13 22:55:20,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:20,604 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:20,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:20,680 INFO L225 Difference]: With dead ends: 16822 [2025-04-13 22:55:20,680 INFO L226 Difference]: Without dead ends: 15800 [2025-04-13 22:55:20,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:20,688 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 138 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:20,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 78 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15800 states. [2025-04-13 22:55:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15800 to 13644. [2025-04-13 22:55:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13644 states, 13643 states have (on average 4.259840211097266) internal successors, (58117), 13643 states have internal predecessors, (58117), 0 states have call successors, (0), 0 states have 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:55:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13644 states to 13644 states and 58117 transitions. [2025-04-13 22:55:21,726 INFO L79 Accepts]: Start accepts. Automaton has 13644 states and 58117 transitions. Word has length 36 [2025-04-13 22:55:21,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:21,726 INFO L485 AbstractCegarLoop]: Abstraction has 13644 states and 58117 transitions. [2025-04-13 22:55:21,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:21,727 INFO L278 IsEmpty]: Start isEmpty. Operand 13644 states and 58117 transitions. [2025-04-13 22:55:21,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:21,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:21,754 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] [2025-04-13 22:55:21,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:55:21,754 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:21,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1283599138, now seen corresponding path program 6 times [2025-04-13 22:55:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:21,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360527172] [2025-04-13 22:55:21,754 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:55:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:21,760 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:21,766 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:21,766 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:55:21,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:21,926 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:55:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:21,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360527172] [2025-04-13 22:55:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360527172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307816267] [2025-04-13 22:55:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:21,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:21,927 INFO L87 Difference]: Start difference. First operand 13644 states and 58117 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:23,619 INFO L93 Difference]: Finished difference Result 18604 states and 78773 transitions. [2025-04-13 22:55:23,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:23,619 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:23,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:23,694 INFO L225 Difference]: With dead ends: 18604 [2025-04-13 22:55:23,694 INFO L226 Difference]: Without dead ends: 17668 [2025-04-13 22:55:23,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:23,702 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 168 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:23,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 105 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17668 states. [2025-04-13 22:55:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17668 to 12952. [2025-04-13 22:55:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12952 states, 12951 states have (on average 4.27874295421203) internal successors, (55414), 12951 states have internal predecessors, (55414), 0 states have call successors, (0), 0 states have 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:55:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 55414 transitions. [2025-04-13 22:55:24,738 INFO L79 Accepts]: Start accepts. Automaton has 12952 states and 55414 transitions. Word has length 36 [2025-04-13 22:55:24,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:24,738 INFO L485 AbstractCegarLoop]: Abstraction has 12952 states and 55414 transitions. [2025-04-13 22:55:24,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:24,739 INFO L278 IsEmpty]: Start isEmpty. Operand 12952 states and 55414 transitions. [2025-04-13 22:55:24,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:24,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:24,766 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] [2025-04-13 22:55:24,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:55:24,766 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:24,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash -623047002, now seen corresponding path program 7 times [2025-04-13 22:55:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:24,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898181370] [2025-04-13 22:55:24,766 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:24,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:55:24,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:24,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:24,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:25,019 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:55:25,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:25,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898181370] [2025-04-13 22:55:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898181370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:25,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716012221] [2025-04-13 22:55:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:25,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:25,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:25,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:25,021 INFO L87 Difference]: Start difference. First operand 12952 states and 55414 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:26,280 INFO L93 Difference]: Finished difference Result 13654 states and 57796 transitions. [2025-04-13 22:55:26,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:55:26,281 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:26,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:26,339 INFO L225 Difference]: With dead ends: 13654 [2025-04-13 22:55:26,340 INFO L226 Difference]: Without dead ends: 13494 [2025-04-13 22:55:26,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:55:26,345 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:26,345 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 64 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13494 states. [2025-04-13 22:55:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13494 to 13020. [2025-04-13 22:55:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13020 states, 13019 states have (on average 4.270450879483831) internal successors, (55597), 13019 states have internal predecessors, (55597), 0 states have call successors, (0), 0 states have 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:55:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 55597 transitions. [2025-04-13 22:55:27,374 INFO L79 Accepts]: Start accepts. Automaton has 13020 states and 55597 transitions. Word has length 36 [2025-04-13 22:55:27,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:27,375 INFO L485 AbstractCegarLoop]: Abstraction has 13020 states and 55597 transitions. [2025-04-13 22:55:27,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:27,375 INFO L278 IsEmpty]: Start isEmpty. Operand 13020 states and 55597 transitions. [2025-04-13 22:55:27,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:27,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:27,399 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] [2025-04-13 22:55:27,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:55:27,399 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:27,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:27,400 INFO L85 PathProgramCache]: Analyzing trace with hash -602036738, now seen corresponding path program 8 times [2025-04-13 22:55:27,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:27,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065789156] [2025-04-13 22:55:27,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:27,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:27,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:27,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:55:27,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:27,565 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:55:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:27,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065789156] [2025-04-13 22:55:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065789156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:27,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467719464] [2025-04-13 22:55:27,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:27,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:27,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:27,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:27,566 INFO L87 Difference]: Start difference. First operand 13020 states and 55597 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:29,270 INFO L93 Difference]: Finished difference Result 16896 states and 71935 transitions. [2025-04-13 22:55:29,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:29,270 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:29,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:29,341 INFO L225 Difference]: With dead ends: 16896 [2025-04-13 22:55:29,341 INFO L226 Difference]: Without dead ends: 16101 [2025-04-13 22:55:29,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:55:29,350 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 142 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:29,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 83 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16101 states. [2025-04-13 22:55:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16101 to 13014. [2025-04-13 22:55:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13014 states, 13013 states have (on average 4.268884961192653) internal successors, (55551), 13013 states have internal predecessors, (55551), 0 states have call successors, (0), 0 states have 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:55:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13014 states to 13014 states and 55551 transitions. [2025-04-13 22:55:30,466 INFO L79 Accepts]: Start accepts. Automaton has 13014 states and 55551 transitions. Word has length 36 [2025-04-13 22:55:30,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:30,467 INFO L485 AbstractCegarLoop]: Abstraction has 13014 states and 55551 transitions. [2025-04-13 22:55:30,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:30,468 INFO L278 IsEmpty]: Start isEmpty. Operand 13014 states and 55551 transitions. [2025-04-13 22:55:30,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:30,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:30,493 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] [2025-04-13 22:55:30,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:55:30,493 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:30,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:30,494 INFO L85 PathProgramCache]: Analyzing trace with hash 490137236, now seen corresponding path program 9 times [2025-04-13 22:55:30,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:30,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289564684] [2025-04-13 22:55:30,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:55:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:30,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:30,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:30,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:55:30,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:30,680 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:55:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:30,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289564684] [2025-04-13 22:55:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289564684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687251147] [2025-04-13 22:55:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:30,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:30,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:30,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:30,681 INFO L87 Difference]: Start difference. First operand 13014 states and 55551 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:32,408 INFO L93 Difference]: Finished difference Result 16804 states and 69931 transitions. [2025-04-13 22:55:32,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:55:32,408 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:32,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:32,480 INFO L225 Difference]: With dead ends: 16804 [2025-04-13 22:55:32,480 INFO L226 Difference]: Without dead ends: 15707 [2025-04-13 22:55:32,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:55:32,489 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 140 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:32,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 64 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15707 states. [2025-04-13 22:55:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15707 to 12920. [2025-04-13 22:55:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12920 states, 12919 states have (on average 4.266661506308538) internal successors, (55121), 12919 states have internal predecessors, (55121), 0 states have call successors, (0), 0 states have 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:55:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12920 states to 12920 states and 55121 transitions. [2025-04-13 22:55:33,629 INFO L79 Accepts]: Start accepts. Automaton has 12920 states and 55121 transitions. Word has length 36 [2025-04-13 22:55:33,629 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:33,629 INFO L485 AbstractCegarLoop]: Abstraction has 12920 states and 55121 transitions. [2025-04-13 22:55:33,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:33,629 INFO L278 IsEmpty]: Start isEmpty. Operand 12920 states and 55121 transitions. [2025-04-13 22:55:33,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:33,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:33,655 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] [2025-04-13 22:55:33,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:55:33,655 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:33,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash -592231838, now seen corresponding path program 10 times [2025-04-13 22:55:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:33,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240135010] [2025-04-13 22:55:33,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:55:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:33,661 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:33,667 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:33,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:55:33,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:33,884 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:55:33,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:33,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240135010] [2025-04-13 22:55:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240135010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:33,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462222603] [2025-04-13 22:55:33,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:33,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:33,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:33,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:33,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:33,885 INFO L87 Difference]: Start difference. First operand 12920 states and 55121 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:36,183 INFO L93 Difference]: Finished difference Result 19728 states and 83440 transitions. [2025-04-13 22:55:36,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:55:36,183 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:36,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:36,271 INFO L225 Difference]: With dead ends: 19728 [2025-04-13 22:55:36,272 INFO L226 Difference]: Without dead ends: 19396 [2025-04-13 22:55:36,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:55:36,278 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 191 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:36,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 97 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19396 states. [2025-04-13 22:55:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19396 to 12984. [2025-04-13 22:55:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12984 states, 12983 states have (on average 4.267503658630517) internal successors, (55405), 12983 states have internal predecessors, (55405), 0 states have call successors, (0), 0 states have 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:55:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12984 states to 12984 states and 55405 transitions. [2025-04-13 22:55:37,544 INFO L79 Accepts]: Start accepts. Automaton has 12984 states and 55405 transitions. Word has length 36 [2025-04-13 22:55:37,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:37,544 INFO L485 AbstractCegarLoop]: Abstraction has 12984 states and 55405 transitions. [2025-04-13 22:55:37,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:37,544 INFO L278 IsEmpty]: Start isEmpty. Operand 12984 states and 55405 transitions. [2025-04-13 22:55:37,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:37,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:37,569 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] [2025-04-13 22:55:37,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:55:37,569 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:37,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1803065236, now seen corresponding path program 11 times [2025-04-13 22:55:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:37,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499723332] [2025-04-13 22:55:37,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:55:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:37,575 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:37,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:37,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:55:37,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:37,710 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:55:37,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:37,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499723332] [2025-04-13 22:55:37,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499723332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:37,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:37,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352026255] [2025-04-13 22:55:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:37,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:37,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:37,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:37,711 INFO L87 Difference]: Start difference. First operand 12984 states and 55405 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:39,376 INFO L93 Difference]: Finished difference Result 14234 states and 60174 transitions. [2025-04-13 22:55:39,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:55:39,376 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:39,376 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:39,437 INFO L225 Difference]: With dead ends: 14234 [2025-04-13 22:55:39,437 INFO L226 Difference]: Without dead ends: 13930 [2025-04-13 22:55:39,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:55:39,443 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:39,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 63 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2025-04-13 22:55:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 12908. [2025-04-13 22:55:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12908 states, 12907 states have (on average 4.2648950182071745) internal successors, (55047), 12907 states have internal predecessors, (55047), 0 states have call successors, (0), 0 states have 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:55:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12908 states to 12908 states and 55047 transitions. [2025-04-13 22:55:40,639 INFO L79 Accepts]: Start accepts. Automaton has 12908 states and 55047 transitions. Word has length 36 [2025-04-13 22:55:40,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:40,639 INFO L485 AbstractCegarLoop]: Abstraction has 12908 states and 55047 transitions. [2025-04-13 22:55:40,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:40,639 INFO L278 IsEmpty]: Start isEmpty. Operand 12908 states and 55047 transitions. [2025-04-13 22:55:40,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:40,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:40,664 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] [2025-04-13 22:55:40,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:55:40,664 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:40,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1315792424, now seen corresponding path program 12 times [2025-04-13 22:55:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:40,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303933102] [2025-04-13 22:55:40,665 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:55:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:40,669 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:40,673 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:40,674 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:55:40,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:40,864 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:55:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:40,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303933102] [2025-04-13 22:55:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303933102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:40,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:40,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:40,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769523198] [2025-04-13 22:55:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:40,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:40,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:40,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:40,865 INFO L87 Difference]: Start difference. First operand 12908 states and 55047 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:44,015 INFO L93 Difference]: Finished difference Result 23851 states and 99743 transitions. [2025-04-13 22:55:44,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:55:44,016 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:44,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:44,115 INFO L225 Difference]: With dead ends: 23851 [2025-04-13 22:55:44,115 INFO L226 Difference]: Without dead ends: 23058 [2025-04-13 22:55:44,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:55:44,124 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 199 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:44,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 105 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:55:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23058 states. [2025-04-13 22:55:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23058 to 13292. [2025-04-13 22:55:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13292 states, 13291 states have (on average 4.318561432548341) internal successors, (57398), 13291 states have internal predecessors, (57398), 0 states have call successors, (0), 0 states have 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:55:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13292 states to 13292 states and 57398 transitions. [2025-04-13 22:55:45,604 INFO L79 Accepts]: Start accepts. Automaton has 13292 states and 57398 transitions. Word has length 36 [2025-04-13 22:55:45,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:45,604 INFO L485 AbstractCegarLoop]: Abstraction has 13292 states and 57398 transitions. [2025-04-13 22:55:45,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:45,604 INFO L278 IsEmpty]: Start isEmpty. Operand 13292 states and 57398 transitions. [2025-04-13 22:55:45,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:45,632 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:45,632 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] [2025-04-13 22:55:45,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:55:45,633 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:45,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1399057244, now seen corresponding path program 13 times [2025-04-13 22:55:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:45,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190694948] [2025-04-13 22:55:45,633 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:45,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:55:45,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:45,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:45,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190694948] [2025-04-13 22:55:45,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190694948] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:45,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21569397] [2025-04-13 22:55:45,891 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:45,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:45,893 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:55:45,894 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:55:45,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:55:45,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:45,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:45,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:45,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 22:55:45,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:55:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:46,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:55:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:46,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21569397] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:46,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:55:46,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 15 [2025-04-13 22:55:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515426637] [2025-04-13 22:55:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:46,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:46,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:46,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:55:46,219 INFO L87 Difference]: Start difference. First operand 13292 states and 57398 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:48,435 INFO L93 Difference]: Finished difference Result 16051 states and 67743 transitions. [2025-04-13 22:55:48,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:48,436 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:48,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:48,501 INFO L225 Difference]: With dead ends: 16051 [2025-04-13 22:55:48,501 INFO L226 Difference]: Without dead ends: 15656 [2025-04-13 22:55:48,506 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:55:48,507 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:48,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 54 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15656 states. [2025-04-13 22:55:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15656 to 12986. [2025-04-13 22:55:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12986 states, 12985 states have (on average 4.30180978051598) internal successors, (55859), 12985 states have internal predecessors, (55859), 0 states have call successors, (0), 0 states have 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:55:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12986 states to 12986 states and 55859 transitions. [2025-04-13 22:55:49,936 INFO L79 Accepts]: Start accepts. Automaton has 12986 states and 55859 transitions. Word has length 36 [2025-04-13 22:55:49,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:49,936 INFO L485 AbstractCegarLoop]: Abstraction has 12986 states and 55859 transitions. [2025-04-13 22:55:49,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:49,936 INFO L278 IsEmpty]: Start isEmpty. Operand 12986 states and 55859 transitions. [2025-04-13 22:55:49,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:49,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:49,960 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] [2025-04-13 22:55:49,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 22:55:50,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 22:55:50,161 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:50,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1617591836, now seen corresponding path program 14 times [2025-04-13 22:55:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:50,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749937389] [2025-04-13 22:55:50,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:50,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:50,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:50,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:50,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:55:50,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:50,336 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:55:50,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:50,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749937389] [2025-04-13 22:55:50,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749937389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:50,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:50,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:55:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96168044] [2025-04-13 22:55:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:50,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:50,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:50,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:50,337 INFO L87 Difference]: Start difference. First operand 12986 states and 55859 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:52,450 INFO L93 Difference]: Finished difference Result 15598 states and 65569 transitions. [2025-04-13 22:55:52,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:55:52,450 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:52,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:52,517 INFO L225 Difference]: With dead ends: 15598 [2025-04-13 22:55:52,518 INFO L226 Difference]: Without dead ends: 15066 [2025-04-13 22:55:52,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:55:52,525 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 156 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:52,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 56 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2025-04-13 22:55:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 13066. [2025-04-13 22:55:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13066 states, 13065 states have (on average 4.290164561806352) internal successors, (56051), 13065 states have internal predecessors, (56051), 0 states have call successors, (0), 0 states have 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:55:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13066 states to 13066 states and 56051 transitions. [2025-04-13 22:55:53,993 INFO L79 Accepts]: Start accepts. Automaton has 13066 states and 56051 transitions. Word has length 36 [2025-04-13 22:55:53,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:53,993 INFO L485 AbstractCegarLoop]: Abstraction has 13066 states and 56051 transitions. [2025-04-13 22:55:53,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:53,993 INFO L278 IsEmpty]: Start isEmpty. Operand 13066 states and 56051 transitions. [2025-04-13 22:55:54,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:54,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:54,018 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] [2025-04-13 22:55:54,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:55:54,018 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:54,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2127448232, now seen corresponding path program 15 times [2025-04-13 22:55:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:54,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413062858] [2025-04-13 22:55:54,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:55:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:54,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:54,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:55:54,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:55:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:54,199 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:55:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:54,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413062858] [2025-04-13 22:55:54,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413062858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:54,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:54,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284316509] [2025-04-13 22:55:54,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:54,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:54,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:54,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:54,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:55:54,200 INFO L87 Difference]: Start difference. First operand 13066 states and 56051 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:56,535 INFO L93 Difference]: Finished difference Result 16354 states and 68060 transitions. [2025-04-13 22:55:56,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:56,536 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:55:56,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:56,607 INFO L225 Difference]: With dead ends: 16354 [2025-04-13 22:55:56,607 INFO L226 Difference]: Without dead ends: 15717 [2025-04-13 22:55:56,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:55:56,614 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 207 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:56,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 81 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:55:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15717 states. [2025-04-13 22:55:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15717 to 13010. [2025-04-13 22:55:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13010 states, 13009 states have (on average 4.291721116150358) internal successors, (55831), 13009 states have internal predecessors, (55831), 0 states have call successors, (0), 0 states have 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:55:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13010 states to 13010 states and 55831 transitions. [2025-04-13 22:55:58,107 INFO L79 Accepts]: Start accepts. Automaton has 13010 states and 55831 transitions. Word has length 36 [2025-04-13 22:55:58,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:58,107 INFO L485 AbstractCegarLoop]: Abstraction has 13010 states and 55831 transitions. [2025-04-13 22:55:58,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:55:58,108 INFO L278 IsEmpty]: Start isEmpty. Operand 13010 states and 55831 transitions. [2025-04-13 22:55:58,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:55:58,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:58,133 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] [2025-04-13 22:55:58,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 22:55:58,133 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:55:58,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -503077650, now seen corresponding path program 16 times [2025-04-13 22:55:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:58,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597108625] [2025-04-13 22:55:58,134 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:55:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:58,138 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:58,143 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:58,143 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:55:58,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:55:58,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:58,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597108625] [2025-04-13 22:55:58,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597108625] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:58,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202624053] [2025-04-13 22:55:58,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:55:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:58,358 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:55:58,359 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:55:58,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:55:58,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:55:58,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:55:58,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:58,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:55:58,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:55:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:55:58,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:55:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202624053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:55:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-04-13 22:55:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986780796] [2025-04-13 22:55:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:58,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:55:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:58,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:55:58,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:55:58,672 INFO L87 Difference]: Start difference. First operand 13010 states and 55831 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:01,652 INFO L93 Difference]: Finished difference Result 18633 states and 77446 transitions. [2025-04-13 22:56:01,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:56:01,653 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:01,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:01,731 INFO L225 Difference]: With dead ends: 18633 [2025-04-13 22:56:01,732 INFO L226 Difference]: Without dead ends: 17505 [2025-04-13 22:56:01,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:56:01,740 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 193 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:01,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 89 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17505 states. [2025-04-13 22:56:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17505 to 13424. [2025-04-13 22:56:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13424 states, 13423 states have (on average 4.305520375474931) internal successors, (57793), 13423 states have internal predecessors, (57793), 0 states have call successors, (0), 0 states have 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:56:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13424 states to 13424 states and 57793 transitions. [2025-04-13 22:56:03,357 INFO L79 Accepts]: Start accepts. Automaton has 13424 states and 57793 transitions. Word has length 36 [2025-04-13 22:56:03,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:03,358 INFO L485 AbstractCegarLoop]: Abstraction has 13424 states and 57793 transitions. [2025-04-13 22:56:03,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:03,358 INFO L278 IsEmpty]: Start isEmpty. Operand 13424 states and 57793 transitions. [2025-04-13 22:56:03,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:03,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:03,384 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] [2025-04-13 22:56:03,390 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:56:03,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:03,585 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:03,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1748584742, now seen corresponding path program 17 times [2025-04-13 22:56:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:03,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348051354] [2025-04-13 22:56:03,585 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:56:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:03,591 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:03,598 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:03,598 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:03,752 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:56:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:03,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348051354] [2025-04-13 22:56:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348051354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:03,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:03,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:03,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490830866] [2025-04-13 22:56:03,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:03,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:03,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:03,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:03,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:03,754 INFO L87 Difference]: Start difference. First operand 13424 states and 57793 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:06,441 INFO L93 Difference]: Finished difference Result 17262 states and 72697 transitions. [2025-04-13 22:56:06,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:06,441 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:06,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:06,519 INFO L225 Difference]: With dead ends: 17262 [2025-04-13 22:56:06,519 INFO L226 Difference]: Without dead ends: 16730 [2025-04-13 22:56:06,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:56:06,528 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 100 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:06,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 72 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16730 states. [2025-04-13 22:56:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16730 to 13650. [2025-04-13 22:56:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13650 states, 13649 states have (on average 4.313136493516009) internal successors, (58870), 13649 states have internal predecessors, (58870), 0 states have call successors, (0), 0 states have 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:56:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13650 states to 13650 states and 58870 transitions. [2025-04-13 22:56:08,243 INFO L79 Accepts]: Start accepts. Automaton has 13650 states and 58870 transitions. Word has length 36 [2025-04-13 22:56:08,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:08,243 INFO L485 AbstractCegarLoop]: Abstraction has 13650 states and 58870 transitions. [2025-04-13 22:56:08,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:08,243 INFO L278 IsEmpty]: Start isEmpty. Operand 13650 states and 58870 transitions. [2025-04-13 22:56:08,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:08,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:08,337 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] [2025-04-13 22:56:08,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:56:08,337 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:08,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1198657514, now seen corresponding path program 18 times [2025-04-13 22:56:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:08,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536968247] [2025-04-13 22:56:08,338 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:56:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:08,342 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:08,355 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:08,355 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:56:08,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:08,505 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:56:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:08,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536968247] [2025-04-13 22:56:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536968247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:08,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489910658] [2025-04-13 22:56:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:08,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:08,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:08,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:08,506 INFO L87 Difference]: Start difference. First operand 13650 states and 58870 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:11,284 INFO L93 Difference]: Finished difference Result 17628 states and 74502 transitions. [2025-04-13 22:56:11,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:11,284 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:11,284 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:11,360 INFO L225 Difference]: With dead ends: 17628 [2025-04-13 22:56:11,360 INFO L226 Difference]: Without dead ends: 16515 [2025-04-13 22:56:11,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:56:11,369 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 161 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:11,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16515 states. [2025-04-13 22:56:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16515 to 13102. [2025-04-13 22:56:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13102 states, 13101 states have (on average 4.359972521181589) internal successors, (57120), 13101 states have internal predecessors, (57120), 0 states have call successors, (0), 0 states have 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:56:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13102 states to 13102 states and 57120 transitions. [2025-04-13 22:56:13,111 INFO L79 Accepts]: Start accepts. Automaton has 13102 states and 57120 transitions. Word has length 36 [2025-04-13 22:56:13,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:13,111 INFO L485 AbstractCegarLoop]: Abstraction has 13102 states and 57120 transitions. [2025-04-13 22:56:13,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:13,111 INFO L278 IsEmpty]: Start isEmpty. Operand 13102 states and 57120 transitions. [2025-04-13 22:56:13,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:13,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:13,136 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] [2025-04-13 22:56:13,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:56:13,137 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:13,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1365349729, now seen corresponding path program 1 times [2025-04-13 22:56:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:13,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787434446] [2025-04-13 22:56:13,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:13,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:56:13,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:13,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:13,290 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:56:13,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:13,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787434446] [2025-04-13 22:56:13,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787434446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:13,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:13,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:13,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882040576] [2025-04-13 22:56:13,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:13,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:13,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:13,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:13,292 INFO L87 Difference]: Start difference. First operand 13102 states and 57120 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:16,033 INFO L93 Difference]: Finished difference Result 18091 states and 78594 transitions. [2025-04-13 22:56:16,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:56:16,033 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:16,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:16,106 INFO L225 Difference]: With dead ends: 18091 [2025-04-13 22:56:16,106 INFO L226 Difference]: Without dead ends: 17018 [2025-04-13 22:56:16,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:56:16,112 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:16,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 104 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2025-04-13 22:56:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 13258. [2025-04-13 22:56:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13258 states, 13257 states have (on average 4.386135626461492) internal successors, (58147), 13257 states have internal predecessors, (58147), 0 states have call successors, (0), 0 states have 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:56:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13258 states to 13258 states and 58147 transitions. [2025-04-13 22:56:17,799 INFO L79 Accepts]: Start accepts. Automaton has 13258 states and 58147 transitions. Word has length 36 [2025-04-13 22:56:17,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:17,799 INFO L485 AbstractCegarLoop]: Abstraction has 13258 states and 58147 transitions. [2025-04-13 22:56:17,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:17,799 INFO L278 IsEmpty]: Start isEmpty. Operand 13258 states and 58147 transitions. [2025-04-13 22:56:17,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:17,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:17,825 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] [2025-04-13 22:56:17,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 22:56:17,825 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:17,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:17,826 INFO L85 PathProgramCache]: Analyzing trace with hash 907050625, now seen corresponding path program 2 times [2025-04-13 22:56:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:17,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866320167] [2025-04-13 22:56:17,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:17,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:17,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:17,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:56:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:17,970 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:56:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:17,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866320167] [2025-04-13 22:56:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866320167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:17,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552574136] [2025-04-13 22:56:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:17,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:17,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:17,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:17,971 INFO L87 Difference]: Start difference. First operand 13258 states and 58147 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:20,874 INFO L93 Difference]: Finished difference Result 17767 states and 77568 transitions. [2025-04-13 22:56:20,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:56:20,874 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:20,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:20,948 INFO L225 Difference]: With dead ends: 17767 [2025-04-13 22:56:20,948 INFO L226 Difference]: Without dead ends: 16778 [2025-04-13 22:56:20,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:56:20,955 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 119 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:20,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 60 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2025-04-13 22:56:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 13188. [2025-04-13 22:56:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13188 states, 13187 states have (on average 4.390232805035262) internal successors, (57894), 13187 states have internal predecessors, (57894), 0 states have call successors, (0), 0 states have 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:56:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13188 states to 13188 states and 57894 transitions. [2025-04-13 22:56:22,658 INFO L79 Accepts]: Start accepts. Automaton has 13188 states and 57894 transitions. Word has length 36 [2025-04-13 22:56:22,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:22,659 INFO L485 AbstractCegarLoop]: Abstraction has 13188 states and 57894 transitions. [2025-04-13 22:56:22,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:22,659 INFO L278 IsEmpty]: Start isEmpty. Operand 13188 states and 57894 transitions. [2025-04-13 22:56:22,684 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:22,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:22,685 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] [2025-04-13 22:56:22,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:56:22,685 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:22,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -307462767, now seen corresponding path program 3 times [2025-04-13 22:56:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:22,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240307544] [2025-04-13 22:56:22,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:22,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:22,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:22,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:56:22,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:22,809 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:56:22,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:22,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240307544] [2025-04-13 22:56:22,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240307544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:22,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:22,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:22,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054344506] [2025-04-13 22:56:22,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:22,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:22,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:22,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:22,811 INFO L87 Difference]: Start difference. First operand 13188 states and 57894 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:25,392 INFO L93 Difference]: Finished difference Result 16427 states and 71714 transitions. [2025-04-13 22:56:25,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:56:25,393 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:25,393 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:25,461 INFO L225 Difference]: With dead ends: 16427 [2025-04-13 22:56:25,461 INFO L226 Difference]: Without dead ends: 14487 [2025-04-13 22:56:25,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:56:25,468 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 131 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:25,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 77 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14487 states. [2025-04-13 22:56:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14487 to 10873. [2025-04-13 22:56:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10873 states, 10872 states have (on average 4.394315673289183) internal successors, (47775), 10872 states have internal predecessors, (47775), 0 states have call successors, (0), 0 states have 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:56:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 47775 transitions. [2025-04-13 22:56:26,921 INFO L79 Accepts]: Start accepts. Automaton has 10873 states and 47775 transitions. Word has length 36 [2025-04-13 22:56:26,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:26,921 INFO L485 AbstractCegarLoop]: Abstraction has 10873 states and 47775 transitions. [2025-04-13 22:56:26,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:26,921 INFO L278 IsEmpty]: Start isEmpty. Operand 10873 states and 47775 transitions. [2025-04-13 22:56:26,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:56:26,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:26,941 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:56:26,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 22:56:26,941 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:26,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1682346430, now seen corresponding path program 1 times [2025-04-13 22:56:26,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:26,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076125787] [2025-04-13 22:56:26,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:26,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:56:26,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:56:26,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:26,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:56:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:27,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076125787] [2025-04-13 22:56:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076125787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297706286] [2025-04-13 22:56:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:27,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:27,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:27,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:27,028 INFO L87 Difference]: Start difference. First operand 10873 states and 47775 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) 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:56:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:29,968 INFO L93 Difference]: Finished difference Result 18887 states and 83579 transitions. [2025-04-13 22:56:29,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:56:29,968 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) 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 41 [2025-04-13 22:56:29,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:30,059 INFO L225 Difference]: With dead ends: 18887 [2025-04-13 22:56:30,060 INFO L226 Difference]: Without dead ends: 18030 [2025-04-13 22:56:30,067 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:56:30,067 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 89 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:30,068 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18030 states. [2025-04-13 22:56:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18030 to 10774. [2025-04-13 22:56:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10774 states, 10773 states have (on average 4.386336210897614) internal successors, (47254), 10773 states have internal predecessors, (47254), 0 states have call successors, (0), 0 states have 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:56:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10774 states to 10774 states and 47254 transitions. [2025-04-13 22:56:31,737 INFO L79 Accepts]: Start accepts. Automaton has 10774 states and 47254 transitions. Word has length 41 [2025-04-13 22:56:31,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:31,738 INFO L485 AbstractCegarLoop]: Abstraction has 10774 states and 47254 transitions. [2025-04-13 22:56:31,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) 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:56:31,738 INFO L278 IsEmpty]: Start isEmpty. Operand 10774 states and 47254 transitions. [2025-04-13 22:56:31,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:56:31,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:31,766 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:56:31,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:56:31,767 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:31,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1673920944, now seen corresponding path program 1 times [2025-04-13 22:56:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:31,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591073427] [2025-04-13 22:56:31,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:31,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:56:31,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:56:31,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:31,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:31,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591073427] [2025-04-13 22:56:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591073427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:31,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154032222] [2025-04-13 22:56:31,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:31,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:31,851 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:56:31,853 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:56:31,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:56:31,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:56:31,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:31,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:31,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:56:31,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:32,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:56:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154032222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:56:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2025-04-13 22:56:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010037207] [2025-04-13 22:56:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:32,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:32,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:32,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:56:32,012 INFO L87 Difference]: Start difference. First operand 10774 states and 47254 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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:56:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:36,126 INFO L93 Difference]: Finished difference Result 23027 states and 101337 transitions. [2025-04-13 22:56:36,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:36,126 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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 41 [2025-04-13 22:56:36,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:36,230 INFO L225 Difference]: With dead ends: 23027 [2025-04-13 22:56:36,230 INFO L226 Difference]: Without dead ends: 22378 [2025-04-13 22:56:36,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:56:36,237 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 178 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:36,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 89 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22378 states. [2025-04-13 22:56:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22378 to 14361. [2025-04-13 22:56:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14361 states, 14360 states have (on average 4.437047353760446) internal successors, (63716), 14360 states have internal predecessors, (63716), 0 states have call successors, (0), 0 states have 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:56:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14361 states to 14361 states and 63716 transitions. [2025-04-13 22:56:38,427 INFO L79 Accepts]: Start accepts. Automaton has 14361 states and 63716 transitions. Word has length 41 [2025-04-13 22:56:38,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:38,427 INFO L485 AbstractCegarLoop]: Abstraction has 14361 states and 63716 transitions. [2025-04-13 22:56:38,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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:56:38,427 INFO L278 IsEmpty]: Start isEmpty. Operand 14361 states and 63716 transitions. [2025-04-13 22:56:38,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:56:38,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:38,459 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:56:38,466 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:56:38,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 22:56:38,660 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:38,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1016359952, now seen corresponding path program 2 times [2025-04-13 22:56:38,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:38,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353475110] [2025-04-13 22:56:38,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:38,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:56:38,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:56:38,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:38,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:38,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:38,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353475110] [2025-04-13 22:56:38,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353475110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:38,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:38,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:56:38,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081742926] [2025-04-13 22:56:38,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:38,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:56:38,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:38,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:56:38,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:56:38,823 INFO L87 Difference]: Start difference. First operand 14361 states and 63716 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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:56:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:42,933 INFO L93 Difference]: Finished difference Result 23473 states and 103643 transitions. [2025-04-13 22:56:42,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:56:42,933 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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 41 [2025-04-13 22:56:42,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:43,039 INFO L225 Difference]: With dead ends: 23473 [2025-04-13 22:56:43,039 INFO L226 Difference]: Without dead ends: 22596 [2025-04-13 22:56:43,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:43,050 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:43,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 45 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22596 states. [2025-04-13 22:56:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22596 to 11217. [2025-04-13 22:56:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11217 states, 11216 states have (on average 4.382845934379458) internal successors, (49158), 11216 states have internal predecessors, (49158), 0 states have call successors, (0), 0 states have 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:56:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11217 states to 11217 states and 49158 transitions. [2025-04-13 22:56:45,103 INFO L79 Accepts]: Start accepts. Automaton has 11217 states and 49158 transitions. Word has length 41 [2025-04-13 22:56:45,103 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:45,103 INFO L485 AbstractCegarLoop]: Abstraction has 11217 states and 49158 transitions. [2025-04-13 22:56:45,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 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:56:45,104 INFO L278 IsEmpty]: Start isEmpty. Operand 11217 states and 49158 transitions. [2025-04-13 22:56:45,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:56:45,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:45,125 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:56:45,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 22:56:45,125 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:45,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash -934116062, now seen corresponding path program 3 times [2025-04-13 22:56:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:45,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077439261] [2025-04-13 22:56:45,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:45,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:45,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:56:45,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 41 statements. [2025-04-13 22:56:45,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:56:45,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:45,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077439261] [2025-04-13 22:56:45,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077439261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:45,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:45,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:45,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310020250] [2025-04-13 22:56:45,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:45,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:56:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:45,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:56:45,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:56:45,250 INFO L87 Difference]: Start difference. First operand 11217 states and 49158 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:56:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:48,451 INFO L93 Difference]: Finished difference Result 15650 states and 68260 transitions. [2025-04-13 22:56:48,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:56:48,451 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 41 [2025-04-13 22:56:48,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:48,520 INFO L225 Difference]: With dead ends: 15650 [2025-04-13 22:56:48,520 INFO L226 Difference]: Without dead ends: 14629 [2025-04-13 22:56:48,526 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:56:48,527 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:48,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 44 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14629 states. [2025-04-13 22:56:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14629 to 12669. [2025-04-13 22:56:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12669 states, 12668 states have (on average 4.404957372908115) internal successors, (55802), 12668 states have internal predecessors, (55802), 0 states have call successors, (0), 0 states have 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:56:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12669 states to 12669 states and 55802 transitions. [2025-04-13 22:56:50,771 INFO L79 Accepts]: Start accepts. Automaton has 12669 states and 55802 transitions. Word has length 41 [2025-04-13 22:56:50,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:50,771 INFO L485 AbstractCegarLoop]: Abstraction has 12669 states and 55802 transitions. [2025-04-13 22:56:50,771 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:56:50,771 INFO L278 IsEmpty]: Start isEmpty. Operand 12669 states and 55802 transitions. [2025-04-13 22:56:50,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:56:50,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:50,796 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:56:50,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 22:56:50,796 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:50,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash -792113084, now seen corresponding path program 4 times [2025-04-13 22:56:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:50,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996030450] [2025-04-13 22:56:50,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:56:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:50,801 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:56:50,807 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:56:50,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:56:50,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:50,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996030450] [2025-04-13 22:56:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996030450] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640274987] [2025-04-13 22:56:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:50,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:50,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:50,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:50,906 INFO L87 Difference]: Start difference. First operand 12669 states and 55802 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) 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:56:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:55,511 INFO L93 Difference]: Finished difference Result 21466 states and 94569 transitions. [2025-04-13 22:56:55,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:56:55,512 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) 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 41 [2025-04-13 22:56:55,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:55,605 INFO L225 Difference]: With dead ends: 21466 [2025-04-13 22:56:55,606 INFO L226 Difference]: Without dead ends: 19912 [2025-04-13 22:56:55,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:56:55,613 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 152 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:55,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 83 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19912 states. [2025-04-13 22:56:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19912 to 12991. [2025-04-13 22:56:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12991 states, 12990 states have (on average 4.420862201693611) internal successors, (57427), 12990 states have internal predecessors, (57427), 0 states have call successors, (0), 0 states have 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:56:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12991 states to 12991 states and 57427 transitions. [2025-04-13 22:56:58,051 INFO L79 Accepts]: Start accepts. Automaton has 12991 states and 57427 transitions. Word has length 41 [2025-04-13 22:56:58,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:58,051 INFO L485 AbstractCegarLoop]: Abstraction has 12991 states and 57427 transitions. [2025-04-13 22:56:58,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) 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:56:58,051 INFO L278 IsEmpty]: Start isEmpty. Operand 12991 states and 57427 transitions. [2025-04-13 22:56:58,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:56:58,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:58,078 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:56:58,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 22:56:58,079 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:58,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash 978743854, now seen corresponding path program 5 times [2025-04-13 22:56:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:58,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521750341] [2025-04-13 22:56:58,079 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:56:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:58,084 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:56:58,093 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:56:58,093 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:58,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:58,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521750341] [2025-04-13 22:56:58,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521750341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:58,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:58,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924274606] [2025-04-13 22:56:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:58,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:56:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:58,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:56:58,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:56:58,310 INFO L87 Difference]: Start difference. First operand 12991 states and 57427 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:57:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:03,227 INFO L93 Difference]: Finished difference Result 21240 states and 93179 transitions. [2025-04-13 22:57:03,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:57:03,227 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 41 [2025-04-13 22:57:03,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:03,360 INFO L225 Difference]: With dead ends: 21240 [2025-04-13 22:57:03,360 INFO L226 Difference]: Without dead ends: 19731 [2025-04-13 22:57:03,367 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:57:03,367 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 101 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:03,367 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 53 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:57:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19731 states. [2025-04-13 22:57:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19731 to 11893. [2025-04-13 22:57:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11893 states, 11892 states have (on average 4.415153044063236) internal successors, (52505), 11892 states have internal predecessors, (52505), 0 states have call successors, (0), 0 states have 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:57:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11893 states to 11893 states and 52505 transitions. [2025-04-13 22:57:05,866 INFO L79 Accepts]: Start accepts. Automaton has 11893 states and 52505 transitions. Word has length 41 [2025-04-13 22:57:05,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:05,866 INFO L485 AbstractCegarLoop]: Abstraction has 11893 states and 52505 transitions. [2025-04-13 22:57:05,867 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:57:05,867 INFO L278 IsEmpty]: Start isEmpty. Operand 11893 states and 52505 transitions. [2025-04-13 22:57:05,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:05,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:05,889 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:57:05,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:57:05,889 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:05,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -899007386, now seen corresponding path program 2 times [2025-04-13 22:57:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:05,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141807891] [2025-04-13 22:57:05,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:57:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:05,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:05,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 41 statements. [2025-04-13 22:57:05,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:57:05,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:57:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:05,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141807891] [2025-04-13 22:57:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141807891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273210837] [2025-04-13 22:57:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:05,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:05,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:05,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:05,969 INFO L87 Difference]: Start difference. First operand 11893 states and 52505 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:57:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:10,212 INFO L93 Difference]: Finished difference Result 17273 states and 76698 transitions. [2025-04-13 22:57:10,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:57:10,212 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 41 [2025-04-13 22:57:10,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:10,286 INFO L225 Difference]: With dead ends: 17273 [2025-04-13 22:57:10,286 INFO L226 Difference]: Without dead ends: 16444 [2025-04-13 22:57:10,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:57:10,292 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:10,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 70 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16444 states. [2025-04-13 22:57:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16444 to 10402. [2025-04-13 22:57:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10402 states, 10401 states have (on average 4.377559850014421) internal successors, (45531), 10401 states have internal predecessors, (45531), 0 states have call successors, (0), 0 states have 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:57:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10402 states to 10402 states and 45531 transitions. [2025-04-13 22:57:12,453 INFO L79 Accepts]: Start accepts. Automaton has 10402 states and 45531 transitions. Word has length 41 [2025-04-13 22:57:12,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:12,454 INFO L485 AbstractCegarLoop]: Abstraction has 10402 states and 45531 transitions. [2025-04-13 22:57:12,454 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:57:12,454 INFO L278 IsEmpty]: Start isEmpty. Operand 10402 states and 45531 transitions. [2025-04-13 22:57:12,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:12,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:12,473 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:57:12,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:57:12,473 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:12,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1547493700, now seen corresponding path program 6 times [2025-04-13 22:57:12,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:12,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337561686] [2025-04-13 22:57:12,474 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:57:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:12,479 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:12,485 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 39 of 41 statements. [2025-04-13 22:57:12,485 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:57:12,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:12,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:12,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337561686] [2025-04-13 22:57:12,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337561686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:12,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:12,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:12,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246692258] [2025-04-13 22:57:12,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:12,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:12,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:12,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:12,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:12,557 INFO L87 Difference]: Start difference. First operand 10402 states and 45531 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:57:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:15,524 INFO L93 Difference]: Finished difference Result 11684 states and 49770 transitions. [2025-04-13 22:57:15,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:57:15,525 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 41 [2025-04-13 22:57:15,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:15,583 INFO L225 Difference]: With dead ends: 11684 [2025-04-13 22:57:15,583 INFO L226 Difference]: Without dead ends: 10510 [2025-04-13 22:57:15,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:15,588 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 86 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:15,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 41 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10510 states. [2025-04-13 22:57:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10510 to 10146. [2025-04-13 22:57:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10146 states, 10145 states have (on average 4.3596845736816165) internal successors, (44229), 10145 states have internal predecessors, (44229), 0 states have call successors, (0), 0 states have 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:57:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 44229 transitions. [2025-04-13 22:57:17,722 INFO L79 Accepts]: Start accepts. Automaton has 10146 states and 44229 transitions. Word has length 41 [2025-04-13 22:57:17,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:17,722 INFO L485 AbstractCegarLoop]: Abstraction has 10146 states and 44229 transitions. [2025-04-13 22:57:17,722 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:57:17,722 INFO L278 IsEmpty]: Start isEmpty. Operand 10146 states and 44229 transitions. [2025-04-13 22:57:17,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:17,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:17,744 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:57:17,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:57:17,744 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:17,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1954255494, now seen corresponding path program 7 times [2025-04-13 22:57:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:17,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359642952] [2025-04-13 22:57:17,744 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:57:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:17,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:57:17,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:57:17,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:57:17,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:17,858 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:57:17,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:17,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359642952] [2025-04-13 22:57:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359642952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:17,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807786401] [2025-04-13 22:57:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:17,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:17,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:17,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:17,859 INFO L87 Difference]: Start difference. First operand 10146 states and 44229 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:57:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:22,664 INFO L93 Difference]: Finished difference Result 18380 states and 78341 transitions. [2025-04-13 22:57:22,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:57:22,664 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 41 [2025-04-13 22:57:22,664 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:22,743 INFO L225 Difference]: With dead ends: 18380 [2025-04-13 22:57:22,744 INFO L226 Difference]: Without dead ends: 17428 [2025-04-13 22:57:22,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:22,750 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 109 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:22,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 54 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17428 states. [2025-04-13 22:57:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17428 to 9568. [2025-04-13 22:57:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9568 states, 9567 states have (on average 4.278561722588063) internal successors, (40933), 9567 states have internal predecessors, (40933), 0 states have call successors, (0), 0 states have 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:57:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9568 states to 9568 states and 40933 transitions. [2025-04-13 22:57:24,845 INFO L79 Accepts]: Start accepts. Automaton has 9568 states and 40933 transitions. Word has length 41 [2025-04-13 22:57:24,846 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:24,846 INFO L485 AbstractCegarLoop]: Abstraction has 9568 states and 40933 transitions. [2025-04-13 22:57:24,846 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:57:24,846 INFO L278 IsEmpty]: Start isEmpty. Operand 9568 states and 40933 transitions. [2025-04-13 22:57:24,863 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:24,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:24,864 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:57:24,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 22:57:24,864 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:24,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1682140766, now seen corresponding path program 8 times [2025-04-13 22:57:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:24,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343690103] [2025-04-13 22:57:24,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:57:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:24,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:24,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-04-13 22:57:24,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:57:24,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:25,023 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:57:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:25,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343690103] [2025-04-13 22:57:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343690103] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:57:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642987651] [2025-04-13 22:57:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:25,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:57:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:25,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:57:25,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:57:25,024 INFO L87 Difference]: Start difference. First operand 9568 states and 40933 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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:57:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:30,128 INFO L93 Difference]: Finished difference Result 16468 states and 68493 transitions. [2025-04-13 22:57:30,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:57:30,128 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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 41 [2025-04-13 22:57:30,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:30,204 INFO L225 Difference]: With dead ends: 16468 [2025-04-13 22:57:30,204 INFO L226 Difference]: Without dead ends: 16025 [2025-04-13 22:57:30,209 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:57:30,209 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 158 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:30,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 107 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16025 states. [2025-04-13 22:57:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16025 to 9580. [2025-04-13 22:57:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9580 states, 9579 states have (on average 4.277586386887984) internal successors, (40975), 9579 states have internal predecessors, (40975), 0 states have call successors, (0), 0 states have 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:57:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9580 states to 9580 states and 40975 transitions. [2025-04-13 22:57:32,375 INFO L79 Accepts]: Start accepts. Automaton has 9580 states and 40975 transitions. Word has length 41 [2025-04-13 22:57:32,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:32,375 INFO L485 AbstractCegarLoop]: Abstraction has 9580 states and 40975 transitions. [2025-04-13 22:57:32,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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:57:32,376 INFO L278 IsEmpty]: Start isEmpty. Operand 9580 states and 40975 transitions. [2025-04-13 22:57:32,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:32,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:32,393 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:57:32,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 22:57:32,393 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:32,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:32,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1364916638, now seen corresponding path program 9 times [2025-04-13 22:57:32,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:32,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331779694] [2025-04-13 22:57:32,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:32,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:32,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:32,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-04-13 22:57:32,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:57:32,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:32,567 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:57:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:32,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331779694] [2025-04-13 22:57:32,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331779694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:32,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:32,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:57:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809982629] [2025-04-13 22:57:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:32,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:57:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:32,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:57:32,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:57:32,568 INFO L87 Difference]: Start difference. First operand 9580 states and 40975 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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:57:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:37,474 INFO L93 Difference]: Finished difference Result 15510 states and 64633 transitions. [2025-04-13 22:57:37,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:57:37,475 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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 41 [2025-04-13 22:57:37,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:37,548 INFO L225 Difference]: With dead ends: 15510 [2025-04-13 22:57:37,548 INFO L226 Difference]: Without dead ends: 15119 [2025-04-13 22:57:37,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:57:37,554 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:37,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 105 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15119 states. [2025-04-13 22:57:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15119 to 9598. [2025-04-13 22:57:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9598 states, 9597 states have (on average 4.278420339689486) internal successors, (41060), 9597 states have internal predecessors, (41060), 0 states have call successors, (0), 0 states have 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:57:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 41060 transitions. [2025-04-13 22:57:39,753 INFO L79 Accepts]: Start accepts. Automaton has 9598 states and 41060 transitions. Word has length 41 [2025-04-13 22:57:39,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:39,754 INFO L485 AbstractCegarLoop]: Abstraction has 9598 states and 41060 transitions. [2025-04-13 22:57:39,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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:57:39,754 INFO L278 IsEmpty]: Start isEmpty. Operand 9598 states and 41060 transitions. [2025-04-13 22:57:39,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:39,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:39,772 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:57:39,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 22:57:39,772 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:39,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1652895778, now seen corresponding path program 10 times [2025-04-13 22:57:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:39,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375027679] [2025-04-13 22:57:39,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:57:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:39,778 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:39,783 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:57:39,783 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:57:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:57:39,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:39,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375027679] [2025-04-13 22:57:39,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375027679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:39,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:39,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860032772] [2025-04-13 22:57:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:39,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:39,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:39,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:39,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:39,880 INFO L87 Difference]: Start difference. First operand 9598 states and 41060 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:57:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:43,762 INFO L93 Difference]: Finished difference Result 13610 states and 57156 transitions. [2025-04-13 22:57:43,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:57:43,763 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 41 [2025-04-13 22:57:43,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:43,827 INFO L225 Difference]: With dead ends: 13610 [2025-04-13 22:57:43,827 INFO L226 Difference]: Without dead ends: 12692 [2025-04-13 22:57:43,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:43,832 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:43,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 49 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12692 states. [2025-04-13 22:57:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12692 to 8318. [2025-04-13 22:57:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8318 states, 8317 states have (on average 4.249128291451244) internal successors, (35340), 8317 states have internal predecessors, (35340), 0 states have call successors, (0), 0 states have 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:57:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8318 states to 8318 states and 35340 transitions. [2025-04-13 22:57:45,641 INFO L79 Accepts]: Start accepts. Automaton has 8318 states and 35340 transitions. Word has length 41 [2025-04-13 22:57:45,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:45,641 INFO L485 AbstractCegarLoop]: Abstraction has 8318 states and 35340 transitions. [2025-04-13 22:57:45,641 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:57:45,642 INFO L278 IsEmpty]: Start isEmpty. Operand 8318 states and 35340 transitions. [2025-04-13 22:57:45,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:45,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:45,657 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:57:45,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 22:57:45,657 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:45,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash 707856474, now seen corresponding path program 3 times [2025-04-13 22:57:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:45,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86998126] [2025-04-13 22:57:45,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:45,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:45,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:57:45,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:57:45,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:57:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:45,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86998126] [2025-04-13 22:57:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86998126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:45,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:45,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451121923] [2025-04-13 22:57:45,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:45,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:45,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:45,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:45,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:45,785 INFO L87 Difference]: Start difference. First operand 8318 states and 35340 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:57:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:49,132 INFO L93 Difference]: Finished difference Result 11656 states and 49608 transitions. [2025-04-13 22:57:49,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:57:49,133 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 41 [2025-04-13 22:57:49,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:49,191 INFO L225 Difference]: With dead ends: 11656 [2025-04-13 22:57:49,192 INFO L226 Difference]: Without dead ends: 10937 [2025-04-13 22:57:49,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:49,195 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 54 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:49,196 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 54 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10937 states. [2025-04-13 22:57:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10937 to 9421. [2025-04-13 22:57:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9421 states, 9420 states have (on average 4.274734607218684) internal successors, (40268), 9420 states have internal predecessors, (40268), 0 states have call successors, (0), 0 states have 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:57:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9421 states to 9421 states and 40268 transitions. [2025-04-13 22:57:51,350 INFO L79 Accepts]: Start accepts. Automaton has 9421 states and 40268 transitions. Word has length 41 [2025-04-13 22:57:51,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:51,350 INFO L485 AbstractCegarLoop]: Abstraction has 9421 states and 40268 transitions. [2025-04-13 22:57:51,350 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:57:51,350 INFO L278 IsEmpty]: Start isEmpty. Operand 9421 states and 40268 transitions. [2025-04-13 22:57:51,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:51,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:51,368 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:57:51,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 22:57:51,368 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:51,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1007913974, now seen corresponding path program 4 times [2025-04-13 22:57:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:51,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587917254] [2025-04-13 22:57:51,369 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:57:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:51,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:51,381 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:57:51,381 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:57:51,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:57:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:51,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587917254] [2025-04-13 22:57:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587917254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:51,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83617796] [2025-04-13 22:57:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:51,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:51,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:51,480 INFO L87 Difference]: Start difference. First operand 9421 states and 40268 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:57:55,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:55,799 INFO L93 Difference]: Finished difference Result 14995 states and 64318 transitions. [2025-04-13 22:57:55,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:57:55,800 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 41 [2025-04-13 22:57:55,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:55,874 INFO L225 Difference]: With dead ends: 14995 [2025-04-13 22:57:55,874 INFO L226 Difference]: Without dead ends: 13922 [2025-04-13 22:57:55,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:57:55,880 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 89 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:55,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 53 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13922 states. [2025-04-13 22:57:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13922 to 8550. [2025-04-13 22:57:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8550 states, 8549 states have (on average 4.265528131945257) internal successors, (36466), 8549 states have internal predecessors, (36466), 0 states have call successors, (0), 0 states have 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:57:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8550 states to 8550 states and 36466 transitions. [2025-04-13 22:57:57,838 INFO L79 Accepts]: Start accepts. Automaton has 8550 states and 36466 transitions. Word has length 41 [2025-04-13 22:57:57,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:57,839 INFO L485 AbstractCegarLoop]: Abstraction has 8550 states and 36466 transitions. [2025-04-13 22:57:57,839 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:57:57,839 INFO L278 IsEmpty]: Start isEmpty. Operand 8550 states and 36466 transitions. [2025-04-13 22:57:57,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:57:57,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:57,855 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:57:57,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 22:57:57,855 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:57,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -471657976, now seen corresponding path program 5 times [2025-04-13 22:57:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:57,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203049981] [2025-04-13 22:57:57,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:57:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:57,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:57:57,866 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:57:57,866 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:57:57,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:57:58,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:58,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203049981] [2025-04-13 22:57:58,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203049981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:58,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:58,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:58,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383646616] [2025-04-13 22:57:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:58,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:57:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:58,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:57:58,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:57:58,003 INFO L87 Difference]: Start difference. First operand 8550 states and 36466 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:58:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:00,620 INFO L93 Difference]: Finished difference Result 9516 states and 39632 transitions. [2025-04-13 22:58:00,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:58:00,621 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 41 [2025-04-13 22:58:00,621 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:00,673 INFO L225 Difference]: With dead ends: 9516 [2025-04-13 22:58:00,673 INFO L226 Difference]: Without dead ends: 8561 [2025-04-13 22:58:00,678 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:58:00,678 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 69 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:00,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 59 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8561 states. [2025-04-13 22:58:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8561 to 8322. [2025-04-13 22:58:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8322 states, 8321 states have (on average 4.261747386131475) internal successors, (35462), 8321 states have internal predecessors, (35462), 0 states have call successors, (0), 0 states have 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:58:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8322 states to 8322 states and 35462 transitions. [2025-04-13 22:58:02,640 INFO L79 Accepts]: Start accepts. Automaton has 8322 states and 35462 transitions. Word has length 41 [2025-04-13 22:58:02,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:02,640 INFO L485 AbstractCegarLoop]: Abstraction has 8322 states and 35462 transitions. [2025-04-13 22:58:02,640 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:58:02,640 INFO L278 IsEmpty]: Start isEmpty. Operand 8322 states and 35462 transitions. [2025-04-13 22:58:02,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:58:02,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:02,657 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:58:02,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 22:58:02,657 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:02,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1463875382, now seen corresponding path program 6 times [2025-04-13 22:58:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:02,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167913673] [2025-04-13 22:58:02,658 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:58:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:02,663 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:58:02,671 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:58:02,671 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:58:02,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:58:02,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:02,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167913673] [2025-04-13 22:58:02,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167913673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:02,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:02,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:58:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150413022] [2025-04-13 22:58:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:02,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:58:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:02,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:58:02,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:58:02,780 INFO L87 Difference]: Start difference. First operand 8322 states and 35462 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:58:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:06,294 INFO L93 Difference]: Finished difference Result 11492 states and 47895 transitions. [2025-04-13 22:58:06,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:58:06,295 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 41 [2025-04-13 22:58:06,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:06,350 INFO L225 Difference]: With dead ends: 11492 [2025-04-13 22:58:06,351 INFO L226 Difference]: Without dead ends: 10773 [2025-04-13 22:58:06,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:58:06,354 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:06,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 38 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10773 states. [2025-04-13 22:58:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10773 to 8086. [2025-04-13 22:58:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8086 states, 8085 states have (on average 4.259863945578231) internal successors, (34441), 8085 states have internal predecessors, (34441), 0 states have call successors, (0), 0 states have 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:58:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 34441 transitions. [2025-04-13 22:58:08,241 INFO L79 Accepts]: Start accepts. Automaton has 8086 states and 34441 transitions. Word has length 41 [2025-04-13 22:58:08,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:08,241 INFO L485 AbstractCegarLoop]: Abstraction has 8086 states and 34441 transitions. [2025-04-13 22:58:08,242 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:58:08,242 INFO L278 IsEmpty]: Start isEmpty. Operand 8086 states and 34441 transitions. [2025-04-13 22:58:08,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:58:08,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:08,256 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:58:08,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 22:58:08,257 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:08,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1163817882, now seen corresponding path program 7 times [2025-04-13 22:58:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:08,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266430341] [2025-04-13 22:58:08,257 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:58:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:08,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:58:08,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:58:08,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:08,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:08,412 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:58:08,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:08,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266430341] [2025-04-13 22:58:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266430341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:08,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752930769] [2025-04-13 22:58:08,412 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:58:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:08,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:08,414 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:58:08,416 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:58:08,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:58:08,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:58:08,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:08,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:08,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:58:08,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:58:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:08,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:58:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752930769] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:58:08,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:58:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 18 [2025-04-13 22:58:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435837226] [2025-04-13 22:58:08,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:58:08,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:58:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:08,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:58:08,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:58:08,892 INFO L87 Difference]: Start difference. First operand 8086 states and 34441 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:31,955 INFO L93 Difference]: Finished difference Result 38851 states and 163608 transitions. [2025-04-13 22:58:31,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2025-04-13 22:58:31,955 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 22:58:31,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:32,128 INFO L225 Difference]: With dead ends: 38851 [2025-04-13 22:58:32,128 INFO L226 Difference]: Without dead ends: 38204 [2025-04-13 22:58:32,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12018 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4687, Invalid=25763, Unknown=0, NotChecked=0, Total=30450 [2025-04-13 22:58:32,144 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 1037 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 4529 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 4703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 4529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:32,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 878 Invalid, 4703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 4529 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 22:58:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38204 states. [2025-04-13 22:58:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38204 to 7668. [2025-04-13 22:58:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7668 states, 7667 states have (on average 4.234381113864615) internal successors, (32465), 7667 states have internal predecessors, (32465), 0 states have call successors, (0), 0 states have 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:58:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7668 states to 7668 states and 32465 transitions. [2025-04-13 22:58:34,564 INFO L79 Accepts]: Start accepts. Automaton has 7668 states and 32465 transitions. Word has length 41 [2025-04-13 22:58:34,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:34,565 INFO L485 AbstractCegarLoop]: Abstraction has 7668 states and 32465 transitions. [2025-04-13 22:58:34,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:34,565 INFO L278 IsEmpty]: Start isEmpty. Operand 7668 states and 32465 transitions. [2025-04-13 22:58:34,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:58:34,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:34,579 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:58:34,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:58:34,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:34,780 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:34,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1163224820, now seen corresponding path program 8 times [2025-04-13 22:58:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:34,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264781310] [2025-04-13 22:58:34,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:58:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:34,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:58:34,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-04-13 22:58:34,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:58:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:34,924 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:58:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:34,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264781310] [2025-04-13 22:58:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264781310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:34,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:58:34,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880903777] [2025-04-13 22:58:34,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:34,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:58:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:34,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:58:34,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:58:34,925 INFO L87 Difference]: Start difference. First operand 7668 states and 32465 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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:58:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:40,295 INFO L93 Difference]: Finished difference Result 12851 states and 53841 transitions. [2025-04-13 22:58:40,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:58:40,296 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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 41 [2025-04-13 22:58:40,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:40,356 INFO L225 Difference]: With dead ends: 12851 [2025-04-13 22:58:40,356 INFO L226 Difference]: Without dead ends: 12400 [2025-04-13 22:58:40,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:58:40,360 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:40,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 98 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:58:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2025-04-13 22:58:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 7718. [2025-04-13 22:58:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7718 states, 7717 states have (on average 4.2399896332771805) internal successors, (32720), 7717 states have internal predecessors, (32720), 0 states have call successors, (0), 0 states have 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:58:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 32720 transitions. [2025-04-13 22:58:42,596 INFO L79 Accepts]: Start accepts. Automaton has 7718 states and 32720 transitions. Word has length 41 [2025-04-13 22:58:42,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:42,597 INFO L485 AbstractCegarLoop]: Abstraction has 7718 states and 32720 transitions. [2025-04-13 22:58:42,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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:58:42,597 INFO L278 IsEmpty]: Start isEmpty. Operand 7718 states and 32720 transitions. [2025-04-13 22:58:42,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:58:42,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:42,611 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:58:42,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 22:58:42,611 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:42,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1519782088, now seen corresponding path program 9 times [2025-04-13 22:58:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:42,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723924340] [2025-04-13 22:58:42,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:58:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:42,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:58:42,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-04-13 22:58:42,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:58:42,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:42,759 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:58:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:42,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723924340] [2025-04-13 22:58:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723924340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:58:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059664928] [2025-04-13 22:58:42,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:42,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:58:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:42,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:58:42,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:58:42,760 INFO L87 Difference]: Start difference. First operand 7718 states and 32720 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) 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:58:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:48,016 INFO L93 Difference]: Finished difference Result 12175 states and 50664 transitions. [2025-04-13 22:58:48,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:58:48,016 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) 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 41 [2025-04-13 22:58:48,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:48,084 INFO L225 Difference]: With dead ends: 12175 [2025-04-13 22:58:48,084 INFO L226 Difference]: Without dead ends: 11846 [2025-04-13 22:58:48,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:58:48,088 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 115 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:48,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 88 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:58:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2025-04-13 22:58:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 7698. [2025-04-13 22:58:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7698 states, 7697 states have (on average 4.239314018448746) internal successors, (32630), 7697 states have internal predecessors, (32630), 0 states have call successors, (0), 0 states have 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:58:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7698 states to 7698 states and 32630 transitions. [2025-04-13 22:58:50,310 INFO L79 Accepts]: Start accepts. Automaton has 7698 states and 32630 transitions. Word has length 41 [2025-04-13 22:58:50,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:50,311 INFO L485 AbstractCegarLoop]: Abstraction has 7698 states and 32630 transitions. [2025-04-13 22:58:50,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) 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:58:50,311 INFO L278 IsEmpty]: Start isEmpty. Operand 7698 states and 32630 transitions. [2025-04-13 22:58:50,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:58:50,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:50,325 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:58:50,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 22:58:50,326 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:50,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1925044956, now seen corresponding path program 10 times [2025-04-13 22:58:50,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:50,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318542573] [2025-04-13 22:58:50,326 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:58:50,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:50,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:58:50,337 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:58:50,337 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:58:50,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:50,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318542573] [2025-04-13 22:58:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318542573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:50,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103524093] [2025-04-13 22:58:50,438 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:58:50,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:50,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:50,440 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:58:50,441 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:58:50,511 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 22:58:50,532 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:58:50,532 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:58:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:50,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:58:50,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:58:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:50,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:58:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103524093] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:50,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:58:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 9] total 19 [2025-04-13 22:58:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407420295] [2025-04-13 22:58:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:50,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:58:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:50,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:58:50,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:58:50,793 INFO L87 Difference]: Start difference. First operand 7698 states and 32630 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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:58:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:55,580 INFO L93 Difference]: Finished difference Result 11626 states and 48636 transitions. [2025-04-13 22:58:55,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:58:55,580 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 41 [2025-04-13 22:58:55,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:55,652 INFO L225 Difference]: With dead ends: 11626 [2025-04-13 22:58:55,652 INFO L226 Difference]: Without dead ends: 11025 [2025-04-13 22:58:55,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:58:55,657 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 122 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:55,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 115 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:58:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11025 states. [2025-04-13 22:58:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11025 to 6788. [2025-04-13 22:58:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6788 states, 6787 states have (on average 4.170178282009725) internal successors, (28303), 6787 states have internal predecessors, (28303), 0 states have call successors, (0), 0 states have 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:58:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6788 states to 6788 states and 28303 transitions. [2025-04-13 22:58:57,651 INFO L79 Accepts]: Start accepts. Automaton has 6788 states and 28303 transitions. Word has length 41 [2025-04-13 22:58:57,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:57,651 INFO L485 AbstractCegarLoop]: Abstraction has 6788 states and 28303 transitions. [2025-04-13 22:58:57,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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:58:57,651 INFO L278 IsEmpty]: Start isEmpty. Operand 6788 states and 28303 transitions. [2025-04-13 22:58:57,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:58:57,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:57,665 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, 1, 1, 1] [2025-04-13 22:58:57,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 22:58:57,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:57,866 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:57,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1643338030, now seen corresponding path program 1 times [2025-04-13 22:58:57,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:57,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622972616] [2025-04-13 22:58:57,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:58:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:57,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:58:57,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:58:57,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:58,470 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:58:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:58,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622972616] [2025-04-13 22:58:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622972616] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:58,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56308314] [2025-04-13 22:58:58,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:58:58,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:58,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:58,472 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:58:58,473 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:58:58,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:58:58,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:58:58,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:58,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:58,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:58:58,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:58:58,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:58:58,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:58:58,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 22:58:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:58:58,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:58:59,297 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:58:59,297 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 168 treesize of output 164 [2025-04-13 22:58:59,334 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:58:59,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2025-04-13 22:58:59,371 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:58:59,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 285 treesize of output 293 [2025-04-13 22:59:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:00,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56308314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:00,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:00,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-04-13 22:59:00,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625480433] [2025-04-13 22:59:00,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:00,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:00,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:00,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:00,574 INFO L87 Difference]: Start difference. First operand 6788 states and 28303 transitions. Second operand has 25 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:59:06,384 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:59:10,603 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:59:17,397 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:59:21,405 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:59:30,063 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 22:59:34,069 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 22:59:39,505 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 22:59:43,992 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 22:59:48,008 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 22:59:52,019 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 22:59:56,028 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:00,034 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:04,062 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:08,080 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:12,091 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:16,101 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:20,112 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:24,125 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:26,609 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:33,642 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:37,675 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:00:41,681 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 23:01:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:05,349 INFO L93 Difference]: Finished difference Result 59662 states and 253500 transitions. [2025-04-13 23:01:05,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:01:05,349 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 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 44 [2025-04-13 23:01:05,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:05,622 INFO L225 Difference]: With dead ends: 59662 [2025-04-13 23:01:05,622 INFO L226 Difference]: Without dead ends: 59613 [2025-04-13 23:01:05,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=474, Invalid=3066, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 23:01:05,641 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 1608 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 87 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:05,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 804 Invalid, 2570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2462 Invalid, 21 Unknown, 0 Unchecked, 92.1s Time] [2025-04-13 23:01:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59613 states. [2025-04-13 23:01:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59613 to 13356. [2025-04-13 23:01:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13356 states, 13355 states have (on average 4.24125795582179) internal successors, (56642), 13355 states have internal predecessors, (56642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13356 states to 13356 states and 56642 transitions. [2025-04-13 23:01:11,799 INFO L79 Accepts]: Start accepts. Automaton has 13356 states and 56642 transitions. Word has length 44 [2025-04-13 23:01:11,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:11,799 INFO L485 AbstractCegarLoop]: Abstraction has 13356 states and 56642 transitions. [2025-04-13 23:01:11,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.75) internal successors, (114), 24 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:11,799 INFO L278 IsEmpty]: Start isEmpty. Operand 13356 states and 56642 transitions. [2025-04-13 23:01:11,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 23:01:11,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:11,825 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, 1, 1, 1] [2025-04-13 23:01:11,831 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 23:01:12,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:12,026 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:01:12,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1276080670, now seen corresponding path program 2 times [2025-04-13 23:01:12,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:12,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522740340] [2025-04-13 23:01:12,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:12,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:01:12,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:01:12,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:12,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:13,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:13,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522740340] [2025-04-13 23:01:13,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522740340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:13,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277816364] [2025-04-13 23:01:13,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:13,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:13,559 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:13,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 23:01:13,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:01:13,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:01:13,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:13,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:13,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 23:01:13,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:13,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 23:01:13,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:01:13,980 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 23:01:13,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 23:01:14,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:01:16,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 23:01:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:16,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:23,539 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:23,540 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 218 treesize of output 210 [2025-04-13 23:01:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:24,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277816364] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:24,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:24,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-13 23:01:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197339831] [2025-04-13 23:01:24,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:24,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:01:24,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:24,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:01:24,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=603, Unknown=1, NotChecked=0, Total=702 [2025-04-13 23:01:24,505 INFO L87 Difference]: Start difference. First operand 13356 states and 56642 transitions. Second operand has 27 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:44,190 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:01:48,204 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:01:59,955 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:02:01,792 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:02:09,622 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:02:21,350 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:02:25,362 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:02:48,675 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:02:52,723 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:03:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:32,494 INFO L93 Difference]: Finished difference Result 84182 states and 360526 transitions. [2025-04-13 23:03:32,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:03:32,494 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 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 44 [2025-04-13 23:03:32,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:32,878 INFO L225 Difference]: With dead ends: 84182 [2025-04-13 23:03:32,878 INFO L226 Difference]: Without dead ends: 84109 [2025-04-13 23:03:32,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=895, Invalid=5266, Unknown=1, NotChecked=0, Total=6162 [2025-04-13 23:03:32,906 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 1629 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 184 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:32,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 1233 Invalid, 3834 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [184 Valid, 3643 Invalid, 7 Unknown, 0 Unchecked, 47.9s Time] [2025-04-13 23:03:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84109 states. [2025-04-13 23:03:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84109 to 28803. [2025-04-13 23:03:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28803 states, 28802 states have (on average 4.2428650788139715) internal successors, (122203), 28802 states have internal predecessors, (122203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28803 states to 28803 states and 122203 transitions. [2025-04-13 23:03:50,237 INFO L79 Accepts]: Start accepts. Automaton has 28803 states and 122203 transitions. Word has length 44 [2025-04-13 23:03:50,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:50,237 INFO L485 AbstractCegarLoop]: Abstraction has 28803 states and 122203 transitions. [2025-04-13 23:03:50,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:50,237 INFO L278 IsEmpty]: Start isEmpty. Operand 28803 states and 122203 transitions. [2025-04-13 23:03:50,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 23:03:50,299 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:50,299 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, 1, 1, 1] [2025-04-13 23:03:50,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:03:50,499 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,SelfDestructingSolverStorable47 [2025-04-13 23:03:50,499 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:03:50,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1332191406, now seen corresponding path program 3 times [2025-04-13 23:03:50,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:50,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699674965] [2025-04-13 23:03:50,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:50,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:50,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:03:50,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:03:50,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:50,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:52,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699674965] [2025-04-13 23:03:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699674965] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:52,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046657231] [2025-04-13 23:03:52,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:52,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:52,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:52,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:52,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:03:52,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:03:52,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:03:52,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:52,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:52,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 23:03:52,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:52,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:03:54,975 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:54,975 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 23 [2025-04-13 23:03:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:55,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:57,811 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:57,812 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 168 treesize of output 164 [2025-04-13 23:03:57,847 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:57,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2025-04-13 23:03:58,143 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:58,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 284 [2025-04-13 23:03:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046657231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:59,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:59,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-13 23:03:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764874358] [2025-04-13 23:03:59,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:59,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:03:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:59,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:03:59,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:03:59,950 INFO L87 Difference]: Start difference. First operand 28803 states and 122203 transitions. Second operand has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 26 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 23:05:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:51,529 INFO L93 Difference]: Finished difference Result 96941 states and 416492 transitions. [2025-04-13 23:05:51,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:05:51,530 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 26 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 44 [2025-04-13 23:05:51,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:51,984 INFO L225 Difference]: With dead ends: 96941 [2025-04-13 23:05:51,984 INFO L226 Difference]: Without dead ends: 91743 [2025-04-13 23:05:52,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=786, Invalid=4764, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:05:52,023 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 1427 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:52,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 916 Invalid, 3074 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2025-04-13 23:05:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91743 states. [2025-04-13 23:06:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91743 to 40438. [2025-04-13 23:06:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40438 states, 40437 states have (on average 4.287929371615105) internal successors, (173391), 40437 states have internal predecessors, (173391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40438 states to 40438 states and 173391 transitions. [2025-04-13 23:06:20,101 INFO L79 Accepts]: Start accepts. Automaton has 40438 states and 173391 transitions. Word has length 44 [2025-04-13 23:06:20,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:20,102 INFO L485 AbstractCegarLoop]: Abstraction has 40438 states and 173391 transitions. [2025-04-13 23:06:20,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 26 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 23:06:20,102 INFO L278 IsEmpty]: Start isEmpty. Operand 40438 states and 173391 transitions. [2025-04-13 23:06:20,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 23:06:20,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:20,189 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, 1, 1, 1] [2025-04-13 23:06:20,195 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 23:06:20,389 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,SelfDestructingSolverStorable48 [2025-04-13 23:06:20,389 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:06:20,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash 78799698, now seen corresponding path program 4 times [2025-04-13 23:06:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:20,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282852218] [2025-04-13 23:06:20,390 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:20,396 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:06:20,408 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:06:20,408 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:20,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:22,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:22,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282852218] [2025-04-13 23:06:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282852218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:22,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330916574] [2025-04-13 23:06:22,128 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:22,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:22,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:06:22,187 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 23:06:22,210 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:06:22,210 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:22,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:22,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 23:06:22,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:22,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 23:06:22,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:06:22,600 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 23:06:22,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 23:06:22,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:06:24,660 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 23:06:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:24,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:31,428 INFO L325 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-04-13 23:06:31,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 528 treesize of output 462 [2025-04-13 23:06:31,471 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:31,472 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 353 treesize of output 341 [2025-04-13 23:06:38,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 52 [2025-04-13 23:06:38,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 52 [2025-04-13 23:06:38,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:38,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 38 [2025-04-13 23:06:38,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 39 treesize of output 33 [2025-04-13 23:06:39,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 63 treesize of output 51 [2025-04-13 23:06:39,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 88 treesize of output 70 [2025-04-13 23:06:39,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 19 [2025-04-13 23:06:39,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 38 [2025-04-13 23:06:39,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 63 treesize of output 51 [2025-04-13 23:06:39,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 82 [2025-04-13 23:06:39,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 27 [2025-04-13 23:06:39,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 25 [2025-04-13 23:06:39,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 58 [2025-04-13 23:06:39,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 63 treesize of output 51 [2025-04-13 23:06:39,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 68 treesize of output 56 [2025-04-13 23:06:39,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:39,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 82 treesize of output 70 [2025-04-13 23:06:40,000 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 77 treesize of output 65 [2025-04-13 23:06:40,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 39 [2025-04-13 23:06:40,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 27 [2025-04-13 23:06:40,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 77 treesize of output 65 [2025-04-13 23:06:40,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:06:40,413 INFO L189 IndexEqualityManager]: detected not equals via solver Received shutdown request... [2025-04-13 23:08:55,312 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:08:55,316 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:08:55,412 WARN L228 SmtUtils]: Removed 1223 from assertion stack [2025-04-13 23:08:55,413 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 23:08:55,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:08:55,614 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,SelfDestructingSolverStorable49 [2025-04-13 23:08:55,614 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 45 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6164 for 134825ms.. [2025-04-13 23:08:55,616 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 23:08:55,616 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 23:08:55,616 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 23:08:55,616 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 23:08:55,618 INFO L422 BasicCegarLoop]: Path program histogram: [18, 10, 10, 4, 3, 1, 1, 1, 1, 1] [2025-04-13 23:08:55,620 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:08:55,620 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:08:55,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:08:55 BasicIcfg [2025-04-13 23:08:55,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:08:55,622 INFO L158 Benchmark]: Toolchain (without parser) took 836243.19ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 110.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2025-04-13 23:08:55,623 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 87.3MB in the end (delta: 114.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:08:55,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.80ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 93.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:08:55,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.75ms. Allocated memory is still 155.2MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:08:55,623 INFO L158 Benchmark]: Boogie Preprocessor took 48.92ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:08:55,623 INFO L158 Benchmark]: IcfgBuilder took 771.15ms. Allocated memory is still 155.2MB. Free memory was 88.8MB in the beginning and 63.7MB in the end (delta: 25.1MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2025-04-13 23:08:55,623 INFO L158 Benchmark]: TraceAbstraction took 835100.84ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 62.9MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2025-04-13 23:08:55,624 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 159.4MB. Free memory was 87.4MB in the beginning and 87.3MB in the end (delta: 114.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.80ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 93.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.75ms. Allocated memory is still 155.2MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 48.92ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 771.15ms. Allocated memory is still 155.2MB. Free memory was 88.8MB in the beginning and 63.7MB in the end (delta: 25.1MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 835100.84ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 62.9MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 3.0GB. 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: 152]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 45 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6164 for 134825ms.. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 45 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6164 for 134825ms.. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 45 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6164 for 134825ms.. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 45 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6164 for 134825ms.. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 45 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6164 for 134825ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 74 locations, 83 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 835.0s, OverallIterations: 50, TraceHistogramMax: 1, PathProgramHistogramMax: 18, EmptinessCheckTime: 1.3s, AutomataDifference: 518.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 11000 SdHoareTripleChecker+Valid, 162.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11000 mSDsluCounter, 6998 SdHoareTripleChecker+Invalid, 158.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5841 mSDsCounter, 776 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27527 IncrementalHoareTripleChecker+Invalid, 28331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 776 mSolverCounterUnsat, 1157 mSDtfsCounter, 27527 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1364 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 738 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16618 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40438occurred in iteration=49, InterpolantAutomatonStates: 693, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 122.0s AutomataMinimizationTime, 49 MinimizatonAttempts, 364224 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 2231 NumberOfCodeBlocks, 2183 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 2452 ConstructedInterpolants, 32 QuantifiedInterpolants, 31613 SizeOfPredicates, 117 NumberOfNonLiveVariables, 2670 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 65 InterpolantComputations, 45 PerfectInterpolantSequences, 120/159 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