/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:24:47,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:24:47,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:24:47,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:24:47,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:24:47,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:24:47,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:24:47,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:24:47,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:24:47,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:24:47,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:24:47,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:24:47,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:24:47,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:24:47,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:24:47,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:24:47,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:24:47,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:24:47,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:24:47,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:24:47,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:24:47,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:24:47,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:24:47,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:24:47,786 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:24:48,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:24:48,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:24:48,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:24:48,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:24:48,050 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:24:48,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2025-04-13 18:24:49,408 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dbcddd8/573e3d50d05e47f3acc62123ee61be08/FLAGe1cd2b2d4 [2025-04-13 18:24:49,609 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:24:49,609 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2025-04-13 18:24:49,618 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dbcddd8/573e3d50d05e47f3acc62123ee61be08/FLAGe1cd2b2d4 [2025-04-13 18:24:50,458 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99dbcddd8/573e3d50d05e47f3acc62123ee61be08 [2025-04-13 18:24:50,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:24:50,462 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:24:50,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:24:50,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:24:50,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:24:50,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71909f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50, skipping insertion in model container [2025-04-13 18:24:50,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:24:50,671 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-series.wvr.c[4403,4416] [2025-04-13 18:24:50,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:24:50,695 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:24:50,735 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-series.wvr.c[4403,4416] [2025-04-13 18:24:50,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:24:50,749 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:24:50,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50 WrapperNode [2025-04-13 18:24:50,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:24:50,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:24:50,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:24:50,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:24:50,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,782 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-04-13 18:24:50,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:24:50,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:24:50,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:24:50,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:24:50,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,817 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 18:24:50,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:24:50,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:24:50,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:24:50,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:24:50,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (1/1) ... [2025-04-13 18:24:50,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:24:50,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:50,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:24:50,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:24:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:24:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:24:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:24:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:24:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:24:50,885 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:24:50,961 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:24:50,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:24:51,314 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:24:51,314 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:24:51,314 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:24:51,632 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:24:51,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:24:51 BoogieIcfgContainer [2025-04-13 18:24:51,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:24:51,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:24:51,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:24:51,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:24:51,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:24:50" (1/3) ... [2025-04-13 18:24:51,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685fe193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:24:51, skipping insertion in model container [2025-04-13 18:24:51,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:24:50" (2/3) ... [2025-04-13 18:24:51,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685fe193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:24:51, skipping insertion in model container [2025-04-13 18:24:51,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:24:51" (3/3) ... [2025-04-13 18:24:51,639 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2025-04-13 18:24:51,650 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:24:51,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series.wvr.c that has 5 procedures, 45 locations, 47 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 18:24:51,652 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:24:51,703 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:24:51,724 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 51 transitions, 130 flow [2025-04-13 18:24:51,917 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4529 states, 4528 states have (on average 4.348056537102473) internal successors, (19688), 4528 states have internal predecessors, (19688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:51,935 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:24:51,942 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;@108492e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:24:51,942 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:24:51,955 INFO L278 IsEmpty]: Start isEmpty. Operand has 4529 states, 4528 states have (on average 4.348056537102473) internal successors, (19688), 4528 states have internal predecessors, (19688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:51,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:24:51,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:51,997 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] [2025-04-13 18:24:51,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:24:52,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1786897594, now seen corresponding path program 1 times [2025-04-13 18:24:52,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:52,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103841787] [2025-04-13 18:24:52,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:24:52,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:52,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:24:52,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:24:52,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:52,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:24:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:52,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103841787] [2025-04-13 18:24:52,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103841787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:52,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:52,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:24:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684148215] [2025-04-13 18:24:52,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:52,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:24:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:52,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:24:52,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:24:52,340 INFO L87 Difference]: Start difference. First operand has 4529 states, 4528 states have (on average 4.348056537102473) internal successors, (19688), 4528 states have internal predecessors, (19688), 0 states have call successors, (0), 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.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:52,630 INFO L93 Difference]: Finished difference Result 7056 states and 30788 transitions. [2025-04-13 18:24:52,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:24:52,636 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 18:24:52,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:52,711 INFO L225 Difference]: With dead ends: 7056 [2025-04-13 18:24:52,711 INFO L226 Difference]: Without dead ends: 6947 [2025-04-13 18:24:52,719 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 18:24:52,720 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:52,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 32 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:24:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2025-04-13 18:24:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 5894. [2025-04-13 18:24:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 5893 states have (on average 4.3560156117427455) internal successors, (25670), 5893 states have internal predecessors, (25670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 25670 transitions. [2025-04-13 18:24:53,097 INFO L79 Accepts]: Start accepts. Automaton has 5894 states and 25670 transitions. Word has length 29 [2025-04-13 18:24:53,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:53,098 INFO L485 AbstractCegarLoop]: Abstraction has 5894 states and 25670 transitions. [2025-04-13 18:24:53,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:53,098 INFO L278 IsEmpty]: Start isEmpty. Operand 5894 states and 25670 transitions. [2025-04-13 18:24:53,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:24:53,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:53,122 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] [2025-04-13 18:24:53,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:24:53,122 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:24:53,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1569675115, now seen corresponding path program 1 times [2025-04-13 18:24:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:53,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420356721] [2025-04-13 18:24:53,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:24:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:53,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:24:53,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:24:53,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:53,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:24:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:53,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420356721] [2025-04-13 18:24:53,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420356721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:53,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:53,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:24:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092262457] [2025-04-13 18:24:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:53,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:24:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:53,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:24:53,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:24:53,347 INFO L87 Difference]: Start difference. First operand 5894 states and 25670 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:53,589 INFO L93 Difference]: Finished difference Result 10591 states and 46118 transitions. [2025-04-13 18:24:53,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:24:53,590 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 18:24:53,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:53,650 INFO L225 Difference]: With dead ends: 10591 [2025-04-13 18:24:53,650 INFO L226 Difference]: Without dead ends: 7435 [2025-04-13 18:24:53,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:24:53,663 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:53,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:24:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2025-04-13 18:24:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7034. [2025-04-13 18:24:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7034 states, 7033 states have (on average 4.324470354045215) internal successors, (30414), 7033 states have internal predecessors, (30414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7034 states to 7034 states and 30414 transitions. [2025-04-13 18:24:53,992 INFO L79 Accepts]: Start accepts. Automaton has 7034 states and 30414 transitions. Word has length 32 [2025-04-13 18:24:53,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:53,992 INFO L485 AbstractCegarLoop]: Abstraction has 7034 states and 30414 transitions. [2025-04-13 18:24:53,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:53,992 INFO L278 IsEmpty]: Start isEmpty. Operand 7034 states and 30414 transitions. [2025-04-13 18:24:54,013 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:24:54,013 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:54,014 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] [2025-04-13 18:24:54,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:24:54,014 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:24:54,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1602731981, now seen corresponding path program 1 times [2025-04-13 18:24:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:54,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028520855] [2025-04-13 18:24:54,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:24:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:54,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:24:54,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:24:54,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:54,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:24:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:54,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028520855] [2025-04-13 18:24:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028520855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:24:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557781677] [2025-04-13 18:24:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:54,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:24:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:54,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:24:54,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:24:54,128 INFO L87 Difference]: Start difference. First operand 7034 states and 30414 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:54,424 INFO L93 Difference]: Finished difference Result 12068 states and 52238 transitions. [2025-04-13 18:24:54,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:24:54,425 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 18:24:54,425 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:54,473 INFO L225 Difference]: With dead ends: 12068 [2025-04-13 18:24:54,474 INFO L226 Difference]: Without dead ends: 8688 [2025-04-13 18:24:54,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:24:54,485 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:54,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:24:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8688 states. [2025-04-13 18:24:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8688 to 8351. [2025-04-13 18:24:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8351 states, 8350 states have (on average 4.275688622754491) internal successors, (35702), 8350 states have internal predecessors, (35702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8351 states to 8351 states and 35702 transitions. [2025-04-13 18:24:54,953 INFO L79 Accepts]: Start accepts. Automaton has 8351 states and 35702 transitions. Word has length 32 [2025-04-13 18:24:54,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:54,954 INFO L485 AbstractCegarLoop]: Abstraction has 8351 states and 35702 transitions. [2025-04-13 18:24:54,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:54,955 INFO L278 IsEmpty]: Start isEmpty. Operand 8351 states and 35702 transitions. [2025-04-13 18:24:54,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:54,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:54,987 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 18:24:54,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:24:54,987 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:24:54,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1623955650, now seen corresponding path program 1 times [2025-04-13 18:24:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:54,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814498705] [2025-04-13 18:24:54,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:24:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:55,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:24:55,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:55,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:55,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:24:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:55,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814498705] [2025-04-13 18:24:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814498705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:55,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:24:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66748244] [2025-04-13 18:24:55,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:55,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:24:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:55,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:24:55,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:24:55,207 INFO L87 Difference]: Start difference. First operand 8351 states and 35702 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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 18:24:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:55,667 INFO L93 Difference]: Finished difference Result 17128 states and 72791 transitions. [2025-04-13 18:24:55,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:24:55,667 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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 18:24:55,667 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:55,724 INFO L225 Difference]: With dead ends: 17128 [2025-04-13 18:24:55,724 INFO L226 Difference]: Without dead ends: 10596 [2025-04-13 18:24:55,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:24:55,740 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:55,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:24:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10596 states. [2025-04-13 18:24:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10596 to 9855. [2025-04-13 18:24:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9855 states, 9854 states have (on average 4.241830728638116) internal successors, (41799), 9854 states have internal predecessors, (41799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9855 states to 9855 states and 41799 transitions. [2025-04-13 18:24:56,148 INFO L79 Accepts]: Start accepts. Automaton has 9855 states and 41799 transitions. Word has length 36 [2025-04-13 18:24:56,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:56,148 INFO L485 AbstractCegarLoop]: Abstraction has 9855 states and 41799 transitions. [2025-04-13 18:24:56,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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 18:24:56,148 INFO L278 IsEmpty]: Start isEmpty. Operand 9855 states and 41799 transitions. [2025-04-13 18:24:56,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:56,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:56,169 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 18:24:56,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:24:56,170 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:24:56,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1443149680, now seen corresponding path program 1 times [2025-04-13 18:24:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:56,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100635978] [2025-04-13 18:24:56,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:24:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:56,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:24:56,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:56,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:56,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:56,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100635978] [2025-04-13 18:24:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100635978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:56,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:56,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:24:56,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766021714] [2025-04-13 18:24:56,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:56,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:24:56,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:56,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:24:56,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:24:56,296 INFO L87 Difference]: Start difference. First operand 9855 states and 41799 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 18:24:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:56,750 INFO L93 Difference]: Finished difference Result 20046 states and 84724 transitions. [2025-04-13 18:24:56,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:24:56,750 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 18:24:56,750 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:56,823 INFO L225 Difference]: With dead ends: 20046 [2025-04-13 18:24:56,823 INFO L226 Difference]: Without dead ends: 12136 [2025-04-13 18:24:56,837 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:24:56,838 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:56,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:24:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12136 states. [2025-04-13 18:24:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12136 to 11545. [2025-04-13 18:24:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11545 states, 11544 states have (on average 4.212058212058212) internal successors, (48624), 11544 states have internal predecessors, (48624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11545 states to 11545 states and 48624 transitions. [2025-04-13 18:24:57,395 INFO L79 Accepts]: Start accepts. Automaton has 11545 states and 48624 transitions. Word has length 36 [2025-04-13 18:24:57,395 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:57,395 INFO L485 AbstractCegarLoop]: Abstraction has 11545 states and 48624 transitions. [2025-04-13 18:24:57,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 18:24:57,396 INFO L278 IsEmpty]: Start isEmpty. Operand 11545 states and 48624 transitions. [2025-04-13 18:24:57,433 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:24:57,433 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:57,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:57,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:24:57,434 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:24:57,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2115965733, now seen corresponding path program 1 times [2025-04-13 18:24:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:57,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031385350] [2025-04-13 18:24:57,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:24:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:57,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:24:57,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:24:57,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:57,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:57,745 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 18:24:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:57,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031385350] [2025-04-13 18:24:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031385350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:57,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:57,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919148748] [2025-04-13 18:24:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:57,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:57,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:57,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:57,746 INFO L87 Difference]: Start difference. First operand 11545 states and 48624 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:58,573 INFO L93 Difference]: Finished difference Result 24995 states and 104699 transitions. [2025-04-13 18:24:58,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:24:58,573 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 18:24:58,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:58,664 INFO L225 Difference]: With dead ends: 24995 [2025-04-13 18:24:58,665 INFO L226 Difference]: Without dead ends: 16896 [2025-04-13 18:24:58,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:58,686 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:58,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 55 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16896 states. [2025-04-13 18:24:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16896 to 11547. [2025-04-13 18:24:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11547 states, 11546 states have (on average 4.211588428893124) internal successors, (48627), 11546 states have internal predecessors, (48627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 48627 transitions. [2025-04-13 18:24:59,221 INFO L79 Accepts]: Start accepts. Automaton has 11547 states and 48627 transitions. Word has length 37 [2025-04-13 18:24:59,222 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:59,222 INFO L485 AbstractCegarLoop]: Abstraction has 11547 states and 48627 transitions. [2025-04-13 18:24:59,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:59,222 INFO L278 IsEmpty]: Start isEmpty. Operand 11547 states and 48627 transitions. [2025-04-13 18:24:59,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:24:59,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:59,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:59,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:24:59,250 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:24:59,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash -774341300, now seen corresponding path program 1 times [2025-04-13 18:24:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:59,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578952210] [2025-04-13 18:24:59,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:24:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:59,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:24:59,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:24:59,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:59,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:59,445 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 18:24:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:59,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578952210] [2025-04-13 18:24:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578952210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:59,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:59,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257192406] [2025-04-13 18:24:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:59,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:59,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:59,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:59,447 INFO L87 Difference]: Start difference. First operand 11547 states and 48627 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:59,999 INFO L93 Difference]: Finished difference Result 15315 states and 63347 transitions. [2025-04-13 18:24:59,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:24:59,999 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 18:24:59,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:00,077 INFO L225 Difference]: With dead ends: 15315 [2025-04-13 18:25:00,077 INFO L226 Difference]: Without dead ends: 13073 [2025-04-13 18:25:00,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:25:00,089 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 82 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:00,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 53 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13073 states. [2025-04-13 18:25:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13073 to 11548. [2025-04-13 18:25:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11548 states, 11547 states have (on average 4.211223694466095) internal successors, (48627), 11547 states have internal predecessors, (48627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11548 states to 11548 states and 48627 transitions. [2025-04-13 18:25:00,627 INFO L79 Accepts]: Start accepts. Automaton has 11548 states and 48627 transitions. Word has length 37 [2025-04-13 18:25:00,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:00,627 INFO L485 AbstractCegarLoop]: Abstraction has 11548 states and 48627 transitions. [2025-04-13 18:25:00,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:00,628 INFO L278 IsEmpty]: Start isEmpty. Operand 11548 states and 48627 transitions. [2025-04-13 18:25:00,654 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:25:00,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:00,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, 1, 1] [2025-04-13 18:25:00,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:25:00,655 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:00,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash 644083577, now seen corresponding path program 1 times [2025-04-13 18:25:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:00,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814728740] [2025-04-13 18:25:00,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:00,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:00,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:25:00,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:25:00,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:00,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:00,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814728740] [2025-04-13 18:25:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814728740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:00,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:00,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774597446] [2025-04-13 18:25:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:00,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:00,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:00,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:00,964 INFO L87 Difference]: Start difference. First operand 11548 states and 48627 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:01,946 INFO L93 Difference]: Finished difference Result 15049 states and 63954 transitions. [2025-04-13 18:25:01,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:25:01,947 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:25:01,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:02,026 INFO L225 Difference]: With dead ends: 15049 [2025-04-13 18:25:02,026 INFO L226 Difference]: Without dead ends: 12116 [2025-04-13 18:25:02,035 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 18:25:02,036 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:02,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 48 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12116 states. [2025-04-13 18:25:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12116 to 9860. [2025-04-13 18:25:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9860 states, 9859 states have (on average 4.240693782330865) internal successors, (41809), 9859 states have internal predecessors, (41809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 41809 transitions. [2025-04-13 18:25:02,897 INFO L79 Accepts]: Start accepts. Automaton has 9860 states and 41809 transitions. Word has length 38 [2025-04-13 18:25:02,897 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:02,897 INFO L485 AbstractCegarLoop]: Abstraction has 9860 states and 41809 transitions. [2025-04-13 18:25:02,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:02,897 INFO L278 IsEmpty]: Start isEmpty. Operand 9860 states and 41809 transitions. [2025-04-13 18:25:02,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:25:02,917 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:02,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:02,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:25:02,917 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:02,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1760888652, now seen corresponding path program 1 times [2025-04-13 18:25:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:02,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794469533] [2025-04-13 18:25:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:02,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:25:02,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:25:02,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:02,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:25:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:03,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794469533] [2025-04-13 18:25:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794469533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405914862] [2025-04-13 18:25:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:03,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:03,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:03,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:03,096 INFO L87 Difference]: Start difference. First operand 9860 states and 41809 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:03,487 INFO L93 Difference]: Finished difference Result 11239 states and 47335 transitions. [2025-04-13 18:25:03,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:25:03,488 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:25:03,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:03,545 INFO L225 Difference]: With dead ends: 11239 [2025-04-13 18:25:03,545 INFO L226 Difference]: Without dead ends: 8993 [2025-04-13 18:25:03,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:03,556 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:03,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 28 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2025-04-13 18:25:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 7921. [2025-04-13 18:25:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 7920 states have (on average 4.26439393939394) internal successors, (33774), 7920 states have internal predecessors, (33774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 33774 transitions. [2025-04-13 18:25:04,028 INFO L79 Accepts]: Start accepts. Automaton has 7921 states and 33774 transitions. Word has length 38 [2025-04-13 18:25:04,028 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:04,029 INFO L485 AbstractCegarLoop]: Abstraction has 7921 states and 33774 transitions. [2025-04-13 18:25:04,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:04,029 INFO L278 IsEmpty]: Start isEmpty. Operand 7921 states and 33774 transitions. [2025-04-13 18:25:04,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:25:04,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:04,043 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] [2025-04-13 18:25:04,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:25:04,043 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:04,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1946826282, now seen corresponding path program 1 times [2025-04-13 18:25:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:04,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67932960] [2025-04-13 18:25:04,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:04,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:25:04,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:25:04,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:25:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:04,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67932960] [2025-04-13 18:25:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67932960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:25:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120278302] [2025-04-13 18:25:04,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:04,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:25:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:04,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:25:04,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:25:04,212 INFO L87 Difference]: Start difference. First operand 7921 states and 33774 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:04,764 INFO L93 Difference]: Finished difference Result 13195 states and 56928 transitions. [2025-04-13 18:25:04,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:25:04,764 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:25:04,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:04,830 INFO L225 Difference]: With dead ends: 13195 [2025-04-13 18:25:04,830 INFO L226 Difference]: Without dead ends: 12378 [2025-04-13 18:25:04,836 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 18:25:04,837 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:04,837 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 80 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12378 states. [2025-04-13 18:25:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12378 to 6952. [2025-04-13 18:25:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6952 states, 6951 states have (on average 4.237807509710833) internal successors, (29457), 6951 states have internal predecessors, (29457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 29457 transitions. [2025-04-13 18:25:05,290 INFO L79 Accepts]: Start accepts. Automaton has 6952 states and 29457 transitions. Word has length 43 [2025-04-13 18:25:05,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:05,291 INFO L485 AbstractCegarLoop]: Abstraction has 6952 states and 29457 transitions. [2025-04-13 18:25:05,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:05,291 INFO L278 IsEmpty]: Start isEmpty. Operand 6952 states and 29457 transitions. [2025-04-13 18:25:05,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:25:05,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:05,303 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] [2025-04-13 18:25:05,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:25:05,303 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:05,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash -598693786, now seen corresponding path program 1 times [2025-04-13 18:25:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:05,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702015559] [2025-04-13 18:25:05,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:05,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:25:05,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:25:05,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:05,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:25:05,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:05,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702015559] [2025-04-13 18:25:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702015559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:05,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:05,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:25:05,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739683626] [2025-04-13 18:25:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:05,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:25:05,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:05,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:25:05,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:25:05,449 INFO L87 Difference]: Start difference. First operand 6952 states and 29457 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:06,291 INFO L93 Difference]: Finished difference Result 13398 states and 57249 transitions. [2025-04-13 18:25:06,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:25:06,291 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:25:06,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:06,354 INFO L225 Difference]: With dead ends: 13398 [2025-04-13 18:25:06,354 INFO L226 Difference]: Without dead ends: 12674 [2025-04-13 18:25:06,360 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 18:25:06,361 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:06,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 80 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12674 states. [2025-04-13 18:25:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12674 to 8380. [2025-04-13 18:25:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8380 states, 8379 states have (on average 4.2517006802721085) internal successors, (35625), 8379 states have internal predecessors, (35625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8380 states to 8380 states and 35625 transitions. [2025-04-13 18:25:07,151 INFO L79 Accepts]: Start accepts. Automaton has 8380 states and 35625 transitions. Word has length 43 [2025-04-13 18:25:07,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:07,151 INFO L485 AbstractCegarLoop]: Abstraction has 8380 states and 35625 transitions. [2025-04-13 18:25:07,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:07,151 INFO L278 IsEmpty]: Start isEmpty. Operand 8380 states and 35625 transitions. [2025-04-13 18:25:07,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:25:07,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:07,167 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] [2025-04-13 18:25:07,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:25:07,167 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:07,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2084489700, now seen corresponding path program 2 times [2025-04-13 18:25:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:07,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726232134] [2025-04-13 18:25:07,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:07,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:25:07,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 43 statements. [2025-04-13 18:25:07,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:25:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:07,305 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 18:25:07,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:07,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726232134] [2025-04-13 18:25:07,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726232134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:07,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:07,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:07,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158893556] [2025-04-13 18:25:07,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:07,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:25:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:07,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:25:07,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:25:07,306 INFO L87 Difference]: Start difference. First operand 8380 states and 35625 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:08,481 INFO L93 Difference]: Finished difference Result 14364 states and 61531 transitions. [2025-04-13 18:25:08,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:25:08,481 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:25:08,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:08,547 INFO L225 Difference]: With dead ends: 14364 [2025-04-13 18:25:08,548 INFO L226 Difference]: Without dead ends: 13640 [2025-04-13 18:25:08,555 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 18:25:08,556 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 100 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:08,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 84 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13640 states. [2025-04-13 18:25:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13640 to 8510. [2025-04-13 18:25:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8510 states, 8509 states have (on average 4.253496298037372) internal successors, (36193), 8509 states have internal predecessors, (36193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8510 states to 8510 states and 36193 transitions. [2025-04-13 18:25:09,261 INFO L79 Accepts]: Start accepts. Automaton has 8510 states and 36193 transitions. Word has length 43 [2025-04-13 18:25:09,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:09,262 INFO L485 AbstractCegarLoop]: Abstraction has 8510 states and 36193 transitions. [2025-04-13 18:25:09,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:09,262 INFO L278 IsEmpty]: Start isEmpty. Operand 8510 states and 36193 transitions. [2025-04-13 18:25:09,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:25:09,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:09,280 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] [2025-04-13 18:25:09,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:25:09,280 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:09,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash 558035408, now seen corresponding path program 3 times [2025-04-13 18:25:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:09,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794128279] [2025-04-13 18:25:09,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:25:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:09,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:25:09,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 43 statements. [2025-04-13 18:25:09,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:25:09,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:25:09,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:09,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794128279] [2025-04-13 18:25:09,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794128279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:09,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:09,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:25:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387397464] [2025-04-13 18:25:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:09,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:25:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:09,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:25:09,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:25:09,480 INFO L87 Difference]: Start difference. First operand 8510 states and 36193 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:10,876 INFO L93 Difference]: Finished difference Result 15158 states and 64902 transitions. [2025-04-13 18:25:10,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:25:10,877 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:25:10,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:10,953 INFO L225 Difference]: With dead ends: 15158 [2025-04-13 18:25:10,953 INFO L226 Difference]: Without dead ends: 14296 [2025-04-13 18:25:10,960 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 18:25:10,961 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 154 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:10,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 108 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:25:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14296 states. [2025-04-13 18:25:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14296 to 9610. [2025-04-13 18:25:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9610 states, 9609 states have (on average 4.2788011239463) internal successors, (41115), 9609 states have internal predecessors, (41115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9610 states to 9610 states and 41115 transitions. [2025-04-13 18:25:11,745 INFO L79 Accepts]: Start accepts. Automaton has 9610 states and 41115 transitions. Word has length 43 [2025-04-13 18:25:11,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:11,746 INFO L485 AbstractCegarLoop]: Abstraction has 9610 states and 41115 transitions. [2025-04-13 18:25:11,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:11,746 INFO L278 IsEmpty]: Start isEmpty. Operand 9610 states and 41115 transitions. [2025-04-13 18:25:11,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:25:11,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:11,762 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] [2025-04-13 18:25:11,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:25:11,763 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:11,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 901698250, now seen corresponding path program 4 times [2025-04-13 18:25:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:11,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520404812] [2025-04-13 18:25:11,763 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:11,770 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:25:11,779 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:25:11,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:11,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:25:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:11,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520404812] [2025-04-13 18:25:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520404812] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:11,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177170497] [2025-04-13 18:25:11,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:11,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:11,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:25:11,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:25:11,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:25:11,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:11,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:11,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:25:11,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:25:12,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177170497] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:12,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:25:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 12 [2025-04-13 18:25:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934668481] [2025-04-13 18:25:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:12,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:25:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:12,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:25:12,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:25:12,207 INFO L87 Difference]: Start difference. First operand 9610 states and 41115 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:13,746 INFO L93 Difference]: Finished difference Result 12585 states and 53284 transitions. [2025-04-13 18:25:13,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:25:13,747 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:25:13,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:13,813 INFO L225 Difference]: With dead ends: 12585 [2025-04-13 18:25:13,813 INFO L226 Difference]: Without dead ends: 11471 [2025-04-13 18:25:13,819 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:25:13,819 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 339 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:13,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 75 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2025-04-13 18:25:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 8660. [2025-04-13 18:25:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 8659 states have (on average 4.237094352696616) internal successors, (36689), 8659 states have internal predecessors, (36689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 36689 transitions. [2025-04-13 18:25:14,600 INFO L79 Accepts]: Start accepts. Automaton has 8660 states and 36689 transitions. Word has length 43 [2025-04-13 18:25:14,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:14,601 INFO L485 AbstractCegarLoop]: Abstraction has 8660 states and 36689 transitions. [2025-04-13 18:25:14,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:14,601 INFO L278 IsEmpty]: Start isEmpty. Operand 8660 states and 36689 transitions. [2025-04-13 18:25:14,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-13 18:25:14,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:14,617 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, 1, 1] [2025-04-13 18:25:14,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:25:14,817 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,SelfDestructingSolverStorable13 [2025-04-13 18:25:14,817 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:14,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1449052871, now seen corresponding path program 1 times [2025-04-13 18:25:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:14,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381007132] [2025-04-13 18:25:14,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:14,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 18:25:14,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:25:14,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:14,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:16,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381007132] [2025-04-13 18:25:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381007132] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:16,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895375035] [2025-04-13 18:25:16,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:16,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:16,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:25:16,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 18:25:16,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:25:16,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:16,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:16,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 18:25:16,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:16,982 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 18:25:17,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 18:25:17,104 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-13 18:25:17,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-13 18:25:17,179 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 18:25:17,250 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-13 18:25:17,251 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 18:25:17,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:25:18,302 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 18:25:18,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 26 [2025-04-13 18:25:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:18,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:19,542 INFO L325 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2025-04-13 18:25:19,543 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 299 treesize of output 125 [2025-04-13 18:25:19,549 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 18:25:19,743 INFO L325 Elim1Store]: treesize reduction 99, result has 71.3 percent of original size [2025-04-13 18:25:19,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 236 treesize of output 393 [2025-04-13 18:25:19,801 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:19,802 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 115 treesize of output 159 [2025-04-13 18:25:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:25,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895375035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:25,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:25,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2025-04-13 18:25:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380773909] [2025-04-13 18:25:25,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:25,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:25:25,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:25,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:25:25,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=911, Unknown=4, NotChecked=0, Total=1056 [2025-04-13 18:25:25,018 INFO L87 Difference]: Start difference. First operand 8660 states and 36689 transitions. Second operand has 33 states, 32 states have (on average 4.0625) internal successors, (130), 32 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:43,738 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 18:25:52,083 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 18:26:02,539 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:26:04,538 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:26:08,916 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 18:26:08,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 18:26:08,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=649, Invalid=3901, Unknown=6, NotChecked=0, Total=4556 [2025-04-13 18:26:08,919 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 1015 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 157 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 3185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:08,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1086 Invalid, 3185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2967 Invalid, 60 Unknown, 0 Unchecked, 21.9s Time] [2025-04-13 18:26:08,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:26:09,120 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,SelfDestructingSolverStorable14 [2025-04-13 18:26:09,121 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:442) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:389) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:477) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2025-04-13 18:26:09,125 INFO L158 Benchmark]: Toolchain (without parser) took 78663.86ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 91.6MB in the beginning and 281.7MB in the end (delta: -190.1MB). Peak memory consumption was 693.8MB. Max. memory is 8.0GB. [2025-04-13 18:26:09,125 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:26:09,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.99ms. Allocated memory is still 125.8MB. Free memory was 91.1MB in the beginning and 75.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 18:26:09,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.89ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 72.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:26:09,126 INFO L158 Benchmark]: Boogie Preprocessor took 52.35ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 69.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:26:09,126 INFO L158 Benchmark]: RCFGBuilder took 796.67ms. Allocated memory is still 125.8MB. Free memory was 69.3MB in the beginning and 75.7MB in the end (delta: -6.4MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. [2025-04-13 18:26:09,126 INFO L158 Benchmark]: TraceAbstraction took 77490.61ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 75.7MB in the beginning and 281.7MB in the end (delta: -206.0MB). Peak memory consumption was 675.4MB. Max. memory is 8.0GB. [2025-04-13 18:26:09,127 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.19ms. Allocated memory is still 167.8MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.99ms. Allocated memory is still 125.8MB. Free memory was 91.1MB in the beginning and 75.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.89ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 72.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.35ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 69.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 796.67ms. Allocated memory is still 125.8MB. Free memory was 69.3MB in the beginning and 75.7MB in the end (delta: -6.4MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. * TraceAbstraction took 77490.61ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 75.7MB in the beginning and 281.7MB in the end (delta: -206.0MB). Peak memory consumption was 675.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...