/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:52:15,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:52:15,309 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 21:52:15,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:52:15,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:52:15,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:52:15,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:52:15,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:52:15,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:52:15,344 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:52:15,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:52:15,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:52:15,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:52:15,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:52:15,344 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:52:15,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:52:15,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:52:15,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:52:15,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:52:15,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:15,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:52:15,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:15,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:52:15,346 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:52:15,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:52:15,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:52:15,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:52:15,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:52:15,598 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:52:15,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i [2025-04-13 21:52:16,944 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b384622/fa2d924e36f2481ea1257144c51412b2/FLAG2a92f565b [2025-04-13 21:52:17,228 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:52:17,228 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i [2025-04-13 21:52:17,247 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b384622/fa2d924e36f2481ea1257144c51412b2/FLAG2a92f565b [2025-04-13 21:52:17,944 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b384622/fa2d924e36f2481ea1257144c51412b2 [2025-04-13 21:52:17,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:52:17,947 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:52:17,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:52:17,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:52:17,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:52:17,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:52:17" (1/1) ... [2025-04-13 21:52:17,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd69364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:17, skipping insertion in model container [2025-04-13 21:52:17,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:52:17" (1/1) ... [2025-04-13 21:52:17,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:52:18,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i[820,833] [2025-04-13 21:52:18,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:52:18,311 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:52:18,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i[820,833] [2025-04-13 21:52:18,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:52:18,414 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:52:18,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18 WrapperNode [2025-04-13 21:52:18,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:52:18,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:52:18,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:52:18,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:52:18,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,461 INFO L138 Inliner]: procedures = 364, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-04-13 21:52:18,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:52:18,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:52:18,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:52:18,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:52:18,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,483 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 21:52:18,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:52:18,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:52:18,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:52:18,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:52:18,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (1/1) ... [2025-04-13 21:52:18,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:52:18,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:18,522 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 21:52:18,526 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 21:52:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:52:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:52:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:52:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-04-13 21:52:18,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-04-13 21:52:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:52:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:52:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:52:18,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:52:18,544 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:52:18,639 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:52:18,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:52:18,739 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:52:18,740 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:52:18,740 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:52:18,856 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:52:18,858 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:52:18,863 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:52:18,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:52:18 BoogieIcfgContainer [2025-04-13 21:52:18,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:52:18,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:52:18,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:52:18,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:52:18,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:52:17" (1/3) ... [2025-04-13 21:52:18,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3e8b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:52:18, skipping insertion in model container [2025-04-13 21:52:18,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:52:18" (2/3) ... [2025-04-13 21:52:18,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3e8b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:52:18, skipping insertion in model container [2025-04-13 21:52:18,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:52:18" (3/3) ... [2025-04-13 21:52:18,872 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.i [2025-04-13 21:52:18,881 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:52:18,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.i that has 2 procedures, 17 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 21:52:18,882 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:52:18,910 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 21:52:18,932 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 20 transitions, 47 flow [2025-04-13 21:52:18,942 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 40 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:18,958 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:52:18,966 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;@1b3d273f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:52:18,966 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 21:52:18,968 INFO L278 IsEmpty]: Start isEmpty. Operand has 40 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:18,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 21:52:18,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:18,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:52:18,972 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:18,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1972682337, now seen corresponding path program 1 times [2025-04-13 21:52:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:18,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297123697] [2025-04-13 21:52:18,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:19,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:52:19,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:52:19,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:19,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:19,126 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 21:52:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:19,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297123697] [2025-04-13 21:52:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297123697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:19,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:19,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:52:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279453944] [2025-04-13 21:52:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:19,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:52:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:19,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:52:19,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:52:19,145 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:19,181 INFO L93 Difference]: Finished difference Result 53 states and 104 transitions. [2025-04-13 21:52:19,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:52:19,182 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-13 21:52:19,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:19,187 INFO L225 Difference]: With dead ends: 53 [2025-04-13 21:52:19,187 INFO L226 Difference]: Without dead ends: 40 [2025-04-13 21:52:19,189 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:52:19,194 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:19,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:52:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-13 21:52:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-13 21:52:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 76 transitions. [2025-04-13 21:52:19,216 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 76 transitions. Word has length 6 [2025-04-13 21:52:19,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:19,216 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 76 transitions. [2025-04-13 21:52:19,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,216 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 76 transitions. [2025-04-13 21:52:19,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:52:19,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:19,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:19,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:52:19,218 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:19,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash -747551607, now seen corresponding path program 1 times [2025-04-13 21:52:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:19,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359919596] [2025-04-13 21:52:19,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:19,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:19,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:52:19,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:52:19,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:19,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:19,298 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 21:52:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:19,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359919596] [2025-04-13 21:52:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359919596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:52:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219276303] [2025-04-13 21:52:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:19,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:52:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:19,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:52:19,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:19,300 INFO L87 Difference]: Start difference. First operand 40 states and 76 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:19,351 INFO L93 Difference]: Finished difference Result 72 states and 138 transitions. [2025-04-13 21:52:19,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:52:19,351 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-04-13 21:52:19,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:19,353 INFO L225 Difference]: With dead ends: 72 [2025-04-13 21:52:19,353 INFO L226 Difference]: Without dead ends: 64 [2025-04-13 21:52:19,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 21:52:19,354 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:19,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:52:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-13 21:52:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-04-13 21:52:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.9682539682539681) internal successors, (124), 63 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 124 transitions. [2025-04-13 21:52:19,362 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 124 transitions. Word has length 14 [2025-04-13 21:52:19,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:19,363 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 124 transitions. [2025-04-13 21:52:19,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,363 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 124 transitions. [2025-04-13 21:52:19,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:52:19,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:19,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:19,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:52:19,365 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:19,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash 6285139, now seen corresponding path program 1 times [2025-04-13 21:52:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:19,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465439159] [2025-04-13 21:52:19,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:19,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:52:19,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:52:19,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:19,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:19,457 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 21:52:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:19,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465439159] [2025-04-13 21:52:19,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465439159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:19,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:19,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:52:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823208022] [2025-04-13 21:52:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:19,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:52:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:19,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:52:19,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:52:19,459 INFO L87 Difference]: Start difference. First operand 64 states and 124 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:19,501 INFO L93 Difference]: Finished difference Result 116 states and 226 transitions. [2025-04-13 21:52:19,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:52:19,501 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 18 [2025-04-13 21:52:19,501 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:19,502 INFO L225 Difference]: With dead ends: 116 [2025-04-13 21:52:19,502 INFO L226 Difference]: Without dead ends: 104 [2025-04-13 21:52:19,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 21:52:19,502 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:19,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:52:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-13 21:52:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-13 21:52:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.9805825242718447) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 204 transitions. [2025-04-13 21:52:19,511 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 204 transitions. Word has length 18 [2025-04-13 21:52:19,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:19,511 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 204 transitions. [2025-04-13 21:52:19,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,511 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 204 transitions. [2025-04-13 21:52:19,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:52:19,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:19,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:19,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:52:19,512 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:19,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 884646997, now seen corresponding path program 1 times [2025-04-13 21:52:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:19,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904008703] [2025-04-13 21:52:19,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:19,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:52:19,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:52:19,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:19,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:52:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:19,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904008703] [2025-04-13 21:52:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904008703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:52:19,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654652154] [2025-04-13 21:52:19,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:52:19,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:19,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:19,595 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 21:52:19,596 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 21:52:19,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:52:19,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:52:19,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:19,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:19,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 21:52:19,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:52:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:52:19,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:52:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:52:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654652154] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:52:19,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:52:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-13 21:52:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698115850] [2025-04-13 21:52:19,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:52:19,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:52:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:19,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:52:19,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:52:19,765 INFO L87 Difference]: Start difference. First operand 104 states and 204 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:19,864 INFO L93 Difference]: Finished difference Result 236 states and 486 transitions. [2025-04-13 21:52:19,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:52:19,864 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 21:52:19,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:19,866 INFO L225 Difference]: With dead ends: 236 [2025-04-13 21:52:19,866 INFO L226 Difference]: Without dead ends: 224 [2025-04-13 21:52:19,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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 21:52:19,866 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:19,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-04-13 21:52:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-04-13 21:52:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.9910313901345291) internal successors, (444), 223 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 444 transitions. [2025-04-13 21:52:19,889 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 444 transitions. Word has length 22 [2025-04-13 21:52:19,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:19,890 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 444 transitions. [2025-04-13 21:52:19,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:19,890 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 444 transitions. [2025-04-13 21:52:19,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 21:52:19,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:19,891 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:19,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 21:52:20,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:20,096 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:20,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash -928927761, now seen corresponding path program 2 times [2025-04-13 21:52:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:20,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384977740] [2025-04-13 21:52:20,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:20,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 21:52:20,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:52:20,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:52:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-13 21:52:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:20,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384977740] [2025-04-13 21:52:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384977740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:52:20,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012350899] [2025-04-13 21:52:20,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:20,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:20,211 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 21:52:20,213 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 21:52:20,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 21:52:20,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 21:52:20,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:52:20,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:20,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 21:52:20,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:52:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-13 21:52:20,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:52:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-13 21:52:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012350899] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:52:20,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:52:20,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-13 21:52:20,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122886368] [2025-04-13 21:52:20,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:52:20,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:52:20,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:20,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:52:20,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:52:20,399 INFO L87 Difference]: Start difference. First operand 224 states and 444 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:20,465 INFO L93 Difference]: Finished difference Result 512 states and 1062 transitions. [2025-04-13 21:52:20,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:52:20,465 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 21:52:20,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:20,467 INFO L225 Difference]: With dead ends: 512 [2025-04-13 21:52:20,467 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 21:52:20,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 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 21:52:20,468 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:20,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 21:52:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-04-13 21:52:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.995893223819302) internal successors, (972), 487 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 972 transitions. [2025-04-13 21:52:20,496 INFO L79 Accepts]: Start accepts. Automaton has 488 states and 972 transitions. Word has length 34 [2025-04-13 21:52:20,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:20,496 INFO L485 AbstractCegarLoop]: Abstraction has 488 states and 972 transitions. [2025-04-13 21:52:20,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:20,496 INFO L278 IsEmpty]: Start isEmpty. Operand 488 states and 972 transitions. [2025-04-13 21:52:20,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-13 21:52:20,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:20,502 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:20,512 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 21:52:20,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:20,703 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:20,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1646156871, now seen corresponding path program 3 times [2025-04-13 21:52:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:20,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14787661] [2025-04-13 21:52:20,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:52:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:20,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 5 equivalence classes. [2025-04-13 21:52:20,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 21:52:20,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 21:52:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-13 21:52:20,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:20,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14787661] [2025-04-13 21:52:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14787661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:52:20,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087158230] [2025-04-13 21:52:20,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:52:20,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:20,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:20,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:52:20,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:52:20,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 5 equivalence classes. [2025-04-13 21:52:20,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 21:52:20,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 21:52:20,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:20,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:52:20,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:52:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-13 21:52:20,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:52:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-13 21:52:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087158230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:52:21,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:52:21,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-13 21:52:21,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406641027] [2025-04-13 21:52:21,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:52:21,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:21,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:21,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:21,061 INFO L87 Difference]: Start difference. First operand 488 states and 972 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:21,228 INFO L93 Difference]: Finished difference Result 1040 states and 2184 transitions. [2025-04-13 21:52:21,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:52:21,228 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 46 [2025-04-13 21:52:21,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:21,232 INFO L225 Difference]: With dead ends: 1040 [2025-04-13 21:52:21,232 INFO L226 Difference]: Without dead ends: 1016 [2025-04-13 21:52:21,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:21,233 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:21,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-04-13 21:52:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-04-13 21:52:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 1.9980295566502464) internal successors, (2028), 1015 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 2028 transitions. [2025-04-13 21:52:21,252 INFO L79 Accepts]: Start accepts. Automaton has 1016 states and 2028 transitions. Word has length 46 [2025-04-13 21:52:21,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:21,252 INFO L485 AbstractCegarLoop]: Abstraction has 1016 states and 2028 transitions. [2025-04-13 21:52:21,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:21,252 INFO L278 IsEmpty]: Start isEmpty. Operand 1016 states and 2028 transitions. [2025-04-13 21:52:21,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 21:52:21,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:21,255 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:21,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:52:21,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:21,459 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:21,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash 200951397, now seen corresponding path program 4 times [2025-04-13 21:52:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:21,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622588970] [2025-04-13 21:52:21,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:52:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:21,482 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 21:52:21,505 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 21:52:21,505 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:52:21,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 21:52:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:21,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622588970] [2025-04-13 21:52:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622588970] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:52:21,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173637303] [2025-04-13 21:52:21,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:52:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:21,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:52:21,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:52:21,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 21:52:21,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 21:52:21,754 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:52:21,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:21,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 21:52:21,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:52:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 21:52:21,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:52:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 21:52:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173637303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:52:21,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:52:21,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-13 21:52:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703878455] [2025-04-13 21:52:21,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:52:21,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:52:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:21,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:52:21,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:21,930 INFO L87 Difference]: Start difference. First operand 1016 states and 2028 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:22,054 INFO L93 Difference]: Finished difference Result 2168 states and 4560 transitions. [2025-04-13 21:52:22,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:52:22,055 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 70 [2025-04-13 21:52:22,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:22,063 INFO L225 Difference]: With dead ends: 2168 [2025-04-13 21:52:22,063 INFO L226 Difference]: Without dead ends: 2120 [2025-04-13 21:52:22,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:52:22,065 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:22,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:52:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2025-04-13 21:52:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2120. [2025-04-13 21:52:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 2119 states have (on average 1.999056158565361) internal successors, (4236), 2119 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 4236 transitions. [2025-04-13 21:52:22,127 INFO L79 Accepts]: Start accepts. Automaton has 2120 states and 4236 transitions. Word has length 70 [2025-04-13 21:52:22,127 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:22,128 INFO L485 AbstractCegarLoop]: Abstraction has 2120 states and 4236 transitions. [2025-04-13 21:52:22,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:22,128 INFO L278 IsEmpty]: Start isEmpty. Operand 2120 states and 4236 transitions. [2025-04-13 21:52:22,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-04-13 21:52:22,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:22,135 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:22,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 21:52:22,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:22,336 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:22,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1015770495, now seen corresponding path program 5 times [2025-04-13 21:52:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:22,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95736518] [2025-04-13 21:52:22,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:52:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:22,352 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 94 statements into 11 equivalence classes. [2025-04-13 21:52:22,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 94 of 94 statements. [2025-04-13 21:52:22,378 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-13 21:52:22,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-04-13 21:52:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:22,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95736518] [2025-04-13 21:52:22,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95736518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:52:22,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562232829] [2025-04-13 21:52:22,626 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:52:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:22,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:52:22,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:52:22,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 94 statements into 11 equivalence classes. [2025-04-13 21:52:22,782 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 94 of 94 statements. [2025-04-13 21:52:22,782 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-13 21:52:22,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:22,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:52:22,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:52:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-04-13 21:52:22,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:52:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-04-13 21:52:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562232829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:52:23,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:52:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-04-13 21:52:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560350546] [2025-04-13 21:52:23,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:52:23,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 21:52:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:23,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 21:52:23,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2025-04-13 21:52:23,232 INFO L87 Difference]: Start difference. First operand 2120 states and 4236 transitions. Second operand has 32 states, 32 states have (on average 4.46875) internal successors, (143), 32 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:29,252 INFO L93 Difference]: Finished difference Result 4197 states and 8830 transitions. [2025-04-13 21:52:29,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2025-04-13 21:52:29,252 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.46875) internal successors, (143), 32 states have internal predecessors, (143), 0 states have call successors, (0), 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 94 [2025-04-13 21:52:29,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:29,266 INFO L225 Difference]: With dead ends: 4197 [2025-04-13 21:52:29,266 INFO L226 Difference]: Without dead ends: 4104 [2025-04-13 21:52:29,277 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 375 SyntacticMatches, 3 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22214 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=16380, Invalid=41460, Unknown=0, NotChecked=0, Total=57840 [2025-04-13 21:52:29,277 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 4822 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4822 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:29,278 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4822 Valid, 0 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:52:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2025-04-13 21:52:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 4104. [2025-04-13 21:52:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4104 states, 4103 states have (on average 1.999512551791372) internal successors, (8204), 4103 states have internal predecessors, (8204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 8204 transitions. [2025-04-13 21:52:29,360 INFO L79 Accepts]: Start accepts. Automaton has 4104 states and 8204 transitions. Word has length 94 [2025-04-13 21:52:29,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:29,360 INFO L485 AbstractCegarLoop]: Abstraction has 4104 states and 8204 transitions. [2025-04-13 21:52:29,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.46875) internal successors, (143), 32 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:29,360 INFO L278 IsEmpty]: Start isEmpty. Operand 4104 states and 8204 transitions. [2025-04-13 21:52:29,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-04-13 21:52:29,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:29,366 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 19, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:29,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:52:29,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:29,570 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:29,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1690428623, now seen corresponding path program 6 times [2025-04-13 21:52:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:29,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389972126] [2025-04-13 21:52:29,571 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:52:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:29,589 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 134 statements into 20 equivalence classes. [2025-04-13 21:52:29,658 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 134 of 134 statements. [2025-04-13 21:52:29,658 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-04-13 21:52:29,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-13 21:52:29,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:29,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389972126] [2025-04-13 21:52:29,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389972126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:52:29,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997762166] [2025-04-13 21:52:29,935 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:52:29,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:29,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:52:29,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:52:30,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 134 statements into 20 equivalence classes. [2025-04-13 21:52:30,320 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 134 of 134 statements. [2025-04-13 21:52:30,321 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-04-13 21:52:30,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:30,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:52:30,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:52:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-13 21:52:30,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:52:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-13 21:52:30,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997762166] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:52:30,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:52:30,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-04-13 21:52:30,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772408273] [2025-04-13 21:52:30,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:52:30,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 21:52:30,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:30,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 21:52:30,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:52:30,634 INFO L87 Difference]: Start difference. First operand 4104 states and 8204 transitions. Second operand has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:30,820 INFO L93 Difference]: Finished difference Result 6812 states and 14192 transitions. [2025-04-13 21:52:30,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:52:30,820 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 0 states have call successors, (0), 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 134 [2025-04-13 21:52:30,821 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:30,842 INFO L225 Difference]: With dead ends: 6812 [2025-04-13 21:52:30,842 INFO L226 Difference]: Without dead ends: 6728 [2025-04-13 21:52:30,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 256 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:52:30,846 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:30,846 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:52:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6728 states. [2025-04-13 21:52:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6728 to 6728. [2025-04-13 21:52:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6728 states, 6727 states have (on average 1.999702690649621) internal successors, (13452), 6727 states have internal predecessors, (13452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 13452 transitions. [2025-04-13 21:52:30,955 INFO L79 Accepts]: Start accepts. Automaton has 6728 states and 13452 transitions. Word has length 134 [2025-04-13 21:52:30,955 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:30,955 INFO L485 AbstractCegarLoop]: Abstraction has 6728 states and 13452 transitions. [2025-04-13 21:52:30,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:30,956 INFO L278 IsEmpty]: Start isEmpty. Operand 6728 states and 13452 transitions. [2025-04-13 21:52:30,965 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-04-13 21:52:30,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:30,966 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:30,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 21:52:31,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:31,167 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:31,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1371058003, now seen corresponding path program 7 times [2025-04-13 21:52:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:31,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604205233] [2025-04-13 21:52:31,167 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:52:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:31,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-04-13 21:52:31,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-04-13 21:52:31,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:31,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 1463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:52:33,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:33,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604205233] [2025-04-13 21:52:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604205233] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:52:33,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172263246] [2025-04-13 21:52:33,151 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:52:33,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:52:33,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:52:33,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 21:52:33,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-04-13 21:52:33,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-04-13 21:52:33,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:52:33,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:33,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-04-13 21:52:33,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:52:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 1463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:52:33,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:52:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 1463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:52:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172263246] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:52:33,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:52:33,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2025-04-13 21:52:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672899601] [2025-04-13 21:52:33,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:52:33,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 21:52:33,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:33,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 21:52:33,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 21:52:33,657 INFO L87 Difference]: Start difference. First operand 6728 states and 13452 transitions. Second operand has 43 states, 42 states have (on average 3.9523809523809526) internal successors, (166), 42 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:37,645 INFO L93 Difference]: Finished difference Result 16033 states and 32060 transitions. [2025-04-13 21:52:37,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 21:52:37,645 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.9523809523809526) internal successors, (166), 42 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-04-13 21:52:37,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:37,690 INFO L225 Difference]: With dead ends: 16033 [2025-04-13 21:52:37,691 INFO L226 Difference]: Without dead ends: 16030 [2025-04-13 21:52:37,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 21:52:37,698 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18536 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 18536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:37,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 18576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 18536 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 21:52:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16030 states. [2025-04-13 21:52:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16030 to 7370. [2025-04-13 21:52:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7370 states, 7369 states have (on average 2.0203555434930114) internal successors, (14888), 7369 states have internal predecessors, (14888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 14888 transitions. [2025-04-13 21:52:37,865 INFO L79 Accepts]: Start accepts. Automaton has 7370 states and 14888 transitions. Word has length 166 [2025-04-13 21:52:37,865 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:37,866 INFO L485 AbstractCegarLoop]: Abstraction has 7370 states and 14888 transitions. [2025-04-13 21:52:37,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.9523809523809526) internal successors, (166), 42 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:37,866 INFO L278 IsEmpty]: Start isEmpty. Operand 7370 states and 14888 transitions. [2025-04-13 21:52:37,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-04-13 21:52:37,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:37,876 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:37,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 21:52:38,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:52:38,082 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:38,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash 274717023, now seen corresponding path program 8 times [2025-04-13 21:52:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:38,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967286196] [2025-04-13 21:52:38,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:52:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:38,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-04-13 21:52:38,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-04-13 21:52:38,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:52:38,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 840 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-04-13 21:52:38,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:38,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967286196] [2025-04-13 21:52:38,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967286196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:38,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:38,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-04-13 21:52:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055451175] [2025-04-13 21:52:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:38,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:52:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:38,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:52:38,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:52:38,550 INFO L87 Difference]: Start difference. First operand 7370 states and 14888 transitions. Second operand has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:38,844 INFO L93 Difference]: Finished difference Result 7549 states and 15092 transitions. [2025-04-13 21:52:38,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:52:38,845 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 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 170 [2025-04-13 21:52:38,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:38,859 INFO L225 Difference]: With dead ends: 7549 [2025-04-13 21:52:38,859 INFO L226 Difference]: Without dead ends: 7056 [2025-04-13 21:52:38,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:52:38,862 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:38,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:52:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7056 states. [2025-04-13 21:52:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7056 to 7056. [2025-04-13 21:52:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7056 states, 7055 states have (on average 1.9875265768958186) internal successors, (14022), 7055 states have internal predecessors, (14022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7056 states to 7056 states and 14022 transitions. [2025-04-13 21:52:38,945 INFO L79 Accepts]: Start accepts. Automaton has 7056 states and 14022 transitions. Word has length 170 [2025-04-13 21:52:38,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:38,945 INFO L485 AbstractCegarLoop]: Abstraction has 7056 states and 14022 transitions. [2025-04-13 21:52:38,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:38,946 INFO L278 IsEmpty]: Start isEmpty. Operand 7056 states and 14022 transitions. [2025-04-13 21:52:38,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-04-13 21:52:38,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:52:38,957 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:52:38,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:52:38,957 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:52:38,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:52:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1249252727, now seen corresponding path program 9 times [2025-04-13 21:52:38,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:52:38,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718354526] [2025-04-13 21:52:38,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:52:38,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:52:38,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 170 statements into 21 equivalence classes. [2025-04-13 21:52:39,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 170 of 170 statements. [2025-04-13 21:52:39,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-04-13 21:52:39,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:52:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 840 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-04-13 21:52:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:52:39,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718354526] [2025-04-13 21:52:39,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718354526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:52:39,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:52:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-04-13 21:52:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97420702] [2025-04-13 21:52:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:52:39,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:52:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:52:39,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:52:39,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:52:39,484 INFO L87 Difference]: Start difference. First operand 7056 states and 14022 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:52:39,758 INFO L93 Difference]: Finished difference Result 7056 states and 14022 transitions. [2025-04-13 21:52:39,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:52:39,758 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-04-13 21:52:39,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:52:39,762 INFO L225 Difference]: With dead ends: 7056 [2025-04-13 21:52:39,762 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:52:39,768 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:52:39,768 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:52:39,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:52:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:52:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:52:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:52:39,770 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2025-04-13 21:52:39,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:52:39,770 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:52:39,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:52:39,770 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:52:39,770 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:52:39,772 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-13 21:52:39,772 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-13 21:52:39,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:52:39,774 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1] [2025-04-13 21:52:39,775 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:52:39,775 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:52:39,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:52:39 BasicIcfg [2025-04-13 21:52:39,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:52:39,777 INFO L158 Benchmark]: Toolchain (without parser) took 21830.92ms. Allocated memory was 142.6MB in the beginning and 474.0MB in the end (delta: 331.4MB). Free memory was 98.8MB in the beginning and 145.6MB in the end (delta: -46.8MB). Peak memory consumption was 283.2MB. Max. memory is 8.0GB. [2025-04-13 21:52:39,778 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:52:39,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.03ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 58.3MB in the end (delta: 40.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 21:52:39,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 55.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:52:39,778 INFO L158 Benchmark]: Boogie Preprocessor took 30.33ms. Allocated memory is still 142.6MB. Free memory was 55.6MB in the beginning and 54.1MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:52:39,778 INFO L158 Benchmark]: IcfgBuilder took 370.89ms. Allocated memory is still 142.6MB. Free memory was 54.1MB in the beginning and 96.3MB in the end (delta: -42.2MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2025-04-13 21:52:39,778 INFO L158 Benchmark]: TraceAbstraction took 20911.91ms. Allocated memory was 142.6MB in the beginning and 474.0MB in the end (delta: 331.4MB). Free memory was 95.5MB in the beginning and 145.6MB in the end (delta: -50.1MB). Peak memory consumption was 280.1MB. Max. memory is 8.0GB. [2025-04-13 21:52:39,779 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.16ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 468.03ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 58.3MB in the end (delta: 40.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 55.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.33ms. Allocated memory is still 142.6MB. Free memory was 55.6MB in the beginning and 54.1MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 370.89ms. Allocated memory is still 142.6MB. Free memory was 54.1MB in the beginning and 96.3MB in the end (delta: -42.2MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. * TraceAbstraction took 20911.91ms. Allocated memory was 142.6MB in the beginning and 474.0MB in the end (delta: 331.4MB). Free memory was 95.5MB in the beginning and 145.6MB in the end (delta: -50.1MB). Peak memory consumption was 280.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 24 locations, 29 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 12, TraceHistogramMax: 21, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5778 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5778 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21263 IncrementalHoareTripleChecker+Invalid, 21310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 0 mSDtfsCounter, 21263 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1678 GetRequests, 1301 SyntacticMatches, 8 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22259 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7370occurred in iteration=10, InterpolantAutomatonStates: 393, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 8660 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1510 NumberOfCodeBlocks, 1510 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 2050 ConstructedInterpolants, 0 QuantifiedInterpolants, 5254 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3142 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 6894/12969 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:52:39,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...