/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:03:55,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:03:55,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:03:55,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:03:55,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:03:55,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:03:55,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:03:55,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:03:55,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:03:55,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:03:55,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:03:55,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:03:55,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:03:55,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:03:55,639 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:03:55,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:03:55,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:03:55,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:55,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:55,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:03:55,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:03:55,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:03:55,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:03:55,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:03:55,642 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:03:55,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:03:55,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:03:55,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:03:55,864 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:03:55,864 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:03:55,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-13 18:03:57,104 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13f67258/8f3558a97b3544c1af6f9e8bd6fac1a9/FLAGf1237b2e3 [2025-04-13 18:03:57,280 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:03:57,280 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-13 18:03:57,289 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13f67258/8f3558a97b3544c1af6f9e8bd6fac1a9/FLAGf1237b2e3 [2025-04-13 18:03:58,305 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13f67258/8f3558a97b3544c1af6f9e8bd6fac1a9 [2025-04-13 18:03:58,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:03:58,308 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:03:58,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:03:58,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:03:58,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:03:58,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8a6b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58, skipping insertion in model container [2025-04-13 18:03:58,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:03:58,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2421,2434] [2025-04-13 18:03:58,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:03:58,457 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:03:58,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2421,2434] [2025-04-13 18:03:58,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:03:58,488 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:03:58,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58 WrapperNode [2025-04-13 18:03:58,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:03:58,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:03:58,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:03:58,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:03:58,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,511 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-04-13 18:03:58,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:03:58,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:03:58,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:03:58,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:03:58,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 18:03:58,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:03:58,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:03:58,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:03:58,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:03:58,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (1/1) ... [2025-04-13 18:03:58,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:58,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:58,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:03:58,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:03:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:03:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:03:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:03:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:03:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:03:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:03:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:03:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:03:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:03:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:03:58,610 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:03:58,668 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:03:58,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:03:58,849 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:03:58,850 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:03:58,850 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:03:58,989 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:03:59,002 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:03:59,008 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:03:59,014 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:03:59,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:03:59 BoogieIcfgContainer [2025-04-13 18:03:59,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:03:59,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:03:59,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:03:59,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:03:59,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:03:58" (1/3) ... [2025-04-13 18:03:59,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56bbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:03:59, skipping insertion in model container [2025-04-13 18:03:59,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:58" (2/3) ... [2025-04-13 18:03:59,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56bbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:03:59, skipping insertion in model container [2025-04-13 18:03:59,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:03:59" (3/3) ... [2025-04-13 18:03:59,023 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-04-13 18:03:59,032 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:03:59,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 29 locations, 39 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 18:03:59,033 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:03:59,103 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:03:59,128 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 42 transitions, 105 flow [2025-04-13 18:03:59,189 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 406 states, 405 states have (on average 5.140740740740741) internal successors, (2082), 405 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:59,207 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:03:59,214 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;@2b3c029e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:03:59,214 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:03:59,217 INFO L278 IsEmpty]: Start isEmpty. Operand has 406 states, 405 states have (on average 5.140740740740741) internal successors, (2082), 405 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:59,226 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:03:59,227 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:59,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:59,228 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:59,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash -673997786, now seen corresponding path program 1 times [2025-04-13 18:03:59,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:59,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590955662] [2025-04-13 18:03:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:59,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:03:59,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:03:59,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:59,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:59,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590955662] [2025-04-13 18:03:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590955662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:59,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:59,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:03:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756433591] [2025-04-13 18:03:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:59,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:03:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:59,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:03:59,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:59,418 INFO L87 Difference]: Start difference. First operand has 406 states, 405 states have (on average 5.140740740740741) internal successors, (2082), 405 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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 18:03:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:59,555 INFO L93 Difference]: Finished difference Result 590 states and 2782 transitions. [2025-04-13 18:03:59,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:03:59,557 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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 18:03:59,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:59,573 INFO L225 Difference]: With dead ends: 590 [2025-04-13 18:03:59,575 INFO L226 Difference]: Without dead ends: 584 [2025-04-13 18:03:59,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:59,579 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:59,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-04-13 18:03:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 430. [2025-04-13 18:03:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 5.062937062937063) internal successors, (2172), 429 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 2172 transitions. [2025-04-13 18:03:59,659 INFO L79 Accepts]: Start accepts. Automaton has 430 states and 2172 transitions. Word has length 14 [2025-04-13 18:03:59,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:59,660 INFO L485 AbstractCegarLoop]: Abstraction has 430 states and 2172 transitions. [2025-04-13 18:03:59,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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 18:03:59,660 INFO L278 IsEmpty]: Start isEmpty. Operand 430 states and 2172 transitions. [2025-04-13 18:03:59,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:59,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:59,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:59,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:03:59,667 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:59,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 340403241, now seen corresponding path program 1 times [2025-04-13 18:03:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:59,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625521401] [2025-04-13 18:03:59,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:59,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:03:59,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:59,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:59,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:59,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:59,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625521401] [2025-04-13 18:03:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625521401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:59,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:59,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:03:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404924345] [2025-04-13 18:03:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:59,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:03:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:59,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:03:59,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:59,780 INFO L87 Difference]: Start difference. First operand 430 states and 2172 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:59,870 INFO L93 Difference]: Finished difference Result 517 states and 2475 transitions. [2025-04-13 18:03:59,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:03:59,870 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-04-13 18:03:59,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:59,874 INFO L225 Difference]: With dead ends: 517 [2025-04-13 18:03:59,875 INFO L226 Difference]: Without dead ends: 414 [2025-04-13 18:03:59,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:59,876 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:59,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-04-13 18:03:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 406. [2025-04-13 18:03:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 4.987654320987654) internal successors, (2020), 405 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 2020 transitions. [2025-04-13 18:03:59,895 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 2020 transitions. Word has length 16 [2025-04-13 18:03:59,895 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:59,895 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 2020 transitions. [2025-04-13 18:03:59,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:59,896 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 2020 transitions. [2025-04-13 18:03:59,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:59,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:59,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:59,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:03:59,898 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:59,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash -975020471, now seen corresponding path program 1 times [2025-04-13 18:03:59,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:59,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022608162] [2025-04-13 18:03:59,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:59,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:03:59,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:59,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:59,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:00,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022608162] [2025-04-13 18:04:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022608162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:00,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:00,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:04:00,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142160842] [2025-04-13 18:04:00,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:00,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:04:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:00,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:04:00,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:00,024 INFO L87 Difference]: Start difference. First operand 406 states and 2020 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:00,111 INFO L93 Difference]: Finished difference Result 490 states and 2306 transitions. [2025-04-13 18:04:00,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:04:00,112 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-04-13 18:04:00,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:00,115 INFO L225 Difference]: With dead ends: 490 [2025-04-13 18:04:00,116 INFO L226 Difference]: Without dead ends: 406 [2025-04-13 18:04:00,117 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:00,119 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:00,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:04:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-04-13 18:04:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-04-13 18:04:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 4.7975308641975305) internal successors, (1943), 405 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1943 transitions. [2025-04-13 18:04:00,137 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1943 transitions. Word has length 16 [2025-04-13 18:04:00,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:00,137 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1943 transitions. [2025-04-13 18:04:00,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,137 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1943 transitions. [2025-04-13 18:04:00,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:04:00,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:00,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:00,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:04:00,139 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:00,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1573400022, now seen corresponding path program 1 times [2025-04-13 18:04:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:00,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274257470] [2025-04-13 18:04:00,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:00,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:04:00,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:04:00,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:00,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:00,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274257470] [2025-04-13 18:04:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274257470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:04:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068638383] [2025-04-13 18:04:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:00,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:04:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:00,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:04:00,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:00,207 INFO L87 Difference]: Start difference. First operand 406 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:00,284 INFO L93 Difference]: Finished difference Result 474 states and 2172 transitions. [2025-04-13 18:04:00,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:04:00,284 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:04:00,284 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:00,288 INFO L225 Difference]: With dead ends: 474 [2025-04-13 18:04:00,289 INFO L226 Difference]: Without dead ends: 406 [2025-04-13 18:04:00,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:00,293 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:00,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:04:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-04-13 18:04:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-04-13 18:04:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 4.6345679012345675) internal successors, (1877), 405 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1877 transitions. [2025-04-13 18:04:00,308 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1877 transitions. Word has length 18 [2025-04-13 18:04:00,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:00,308 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1877 transitions. [2025-04-13 18:04:00,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,308 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1877 transitions. [2025-04-13 18:04:00,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:04:00,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:00,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:00,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:04:00,311 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:00,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:00,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1602746603, now seen corresponding path program 1 times [2025-04-13 18:04:00,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:00,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610862757] [2025-04-13 18:04:00,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:00,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:00,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:04:00,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:04:00,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:00,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:00,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:00,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610862757] [2025-04-13 18:04:00,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610862757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:00,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:00,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:04:00,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168372081] [2025-04-13 18:04:00,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:00,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:04:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:00,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:04:00,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:04:00,513 INFO L87 Difference]: Start difference. First operand 406 states and 1877 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:00,636 INFO L93 Difference]: Finished difference Result 798 states and 3797 transitions. [2025-04-13 18:04:00,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:04:00,637 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-04-13 18:04:00,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:00,642 INFO L225 Difference]: With dead ends: 798 [2025-04-13 18:04:00,642 INFO L226 Difference]: Without dead ends: 483 [2025-04-13 18:04:00,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:04:00,644 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:00,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 9 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:04:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-04-13 18:04:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-04-13 18:04:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 4.429460580912863) internal successors, (2135), 482 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 2135 transitions. [2025-04-13 18:04:00,663 INFO L79 Accepts]: Start accepts. Automaton has 483 states and 2135 transitions. Word has length 20 [2025-04-13 18:04:00,663 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:00,663 INFO L485 AbstractCegarLoop]: Abstraction has 483 states and 2135 transitions. [2025-04-13 18:04:00,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,664 INFO L278 IsEmpty]: Start isEmpty. Operand 483 states and 2135 transitions. [2025-04-13 18:04:00,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:04:00,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:00,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:00,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:04:00,666 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:00,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash 473107146, now seen corresponding path program 1 times [2025-04-13 18:04:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:00,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327800077] [2025-04-13 18:04:00,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:00,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:04:00,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:04:00,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:00,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:04:00,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:00,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327800077] [2025-04-13 18:04:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327800077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:00,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:00,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:04:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603470538] [2025-04-13 18:04:00,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:00,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:04:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:00,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:04:00,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:04:00,872 INFO L87 Difference]: Start difference. First operand 483 states and 2135 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:00,957 INFO L93 Difference]: Finished difference Result 890 states and 3908 transitions. [2025-04-13 18:04:00,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:04:00,957 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 18:04:00,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:00,961 INFO L225 Difference]: With dead ends: 890 [2025-04-13 18:04:00,962 INFO L226 Difference]: Without dead ends: 483 [2025-04-13 18:04:00,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:04:00,963 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:00,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 12 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:04:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-04-13 18:04:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-04-13 18:04:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 3.9688796680497926) internal successors, (1913), 482 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1913 transitions. [2025-04-13 18:04:00,983 INFO L79 Accepts]: Start accepts. Automaton has 483 states and 1913 transitions. Word has length 22 [2025-04-13 18:04:00,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:00,984 INFO L485 AbstractCegarLoop]: Abstraction has 483 states and 1913 transitions. [2025-04-13 18:04:00,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,984 INFO L278 IsEmpty]: Start isEmpty. Operand 483 states and 1913 transitions. [2025-04-13 18:04:00,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:04:00,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:00,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:00,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:04:00,986 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:00,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash 894840870, now seen corresponding path program 1 times [2025-04-13 18:04:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:00,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546645163] [2025-04-13 18:04:00,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:00,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:04:01,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:04:01,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:01,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:04:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:01,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546645163] [2025-04-13 18:04:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546645163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:04:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351608495] [2025-04-13 18:04:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:01,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:04:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:01,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:04:01,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:04:01,132 INFO L87 Difference]: Start difference. First operand 483 states and 1913 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:01,215 INFO L93 Difference]: Finished difference Result 880 states and 3637 transitions. [2025-04-13 18:04:01,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:04:01,216 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-04-13 18:04:01,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:01,221 INFO L225 Difference]: With dead ends: 880 [2025-04-13 18:04:01,221 INFO L226 Difference]: Without dead ends: 562 [2025-04-13 18:04:01,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:04:01,223 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:01,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 9 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:04:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-04-13 18:04:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-04-13 18:04:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.798573975044563) internal successors, (2131), 561 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 2131 transitions. [2025-04-13 18:04:01,252 INFO L79 Accepts]: Start accepts. Automaton has 562 states and 2131 transitions. Word has length 24 [2025-04-13 18:04:01,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:01,253 INFO L485 AbstractCegarLoop]: Abstraction has 562 states and 2131 transitions. [2025-04-13 18:04:01,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:01,253 INFO L278 IsEmpty]: Start isEmpty. Operand 562 states and 2131 transitions. [2025-04-13 18:04:01,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:04:01,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:01,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:01,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:04:01,255 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:01,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1186738567, now seen corresponding path program 1 times [2025-04-13 18:04:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:01,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477920129] [2025-04-13 18:04:01,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:01,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 18:04:01,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:01,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:01,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:01,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477920129] [2025-04-13 18:04:01,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477920129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:01,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037570013] [2025-04-13 18:04:01,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:01,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:01,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:04:01,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:04:01,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 18:04:01,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:01,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:01,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:01,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:04:01,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:01,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037570013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:01,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 18:04:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33170278] [2025-04-13 18:04:01,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:01,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:04:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:01,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:04:01,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:04:01,607 INFO L87 Difference]: Start difference. First operand 562 states and 2131 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:01,877 INFO L93 Difference]: Finished difference Result 1822 states and 6896 transitions. [2025-04-13 18:04:01,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:04:01,877 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:04:01,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:01,889 INFO L225 Difference]: With dead ends: 1822 [2025-04-13 18:04:01,889 INFO L226 Difference]: Without dead ends: 1816 [2025-04-13 18:04:01,890 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:04:01,891 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:01,891 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-04-13 18:04:01,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1058. [2025-04-13 18:04:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1057 states have (on average 3.8230842005676444) internal successors, (4041), 1057 states have internal predecessors, (4041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 4041 transitions. [2025-04-13 18:04:01,936 INFO L79 Accepts]: Start accepts. Automaton has 1058 states and 4041 transitions. Word has length 26 [2025-04-13 18:04:01,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:01,937 INFO L485 AbstractCegarLoop]: Abstraction has 1058 states and 4041 transitions. [2025-04-13 18:04:01,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:01,937 INFO L278 IsEmpty]: Start isEmpty. Operand 1058 states and 4041 transitions. [2025-04-13 18:04:01,940 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:04:01,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:01,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:01,947 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 18:04:02,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:02,141 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:02,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1195816713, now seen corresponding path program 2 times [2025-04-13 18:04:02,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:02,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312225205] [2025-04-13 18:04:02,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:02,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:02,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:02,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:02,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:02,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:02,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312225205] [2025-04-13 18:04:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312225205] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:02,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719292646] [2025-04-13 18:04:02,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:02,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:02,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:02,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:04:02,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:04:02,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:02,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:02,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:02,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:02,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:04:02,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:02,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:02,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719292646] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:02,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 18:04:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922803952] [2025-04-13 18:04:02,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:02,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:04:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:02,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:04:02,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:04:02,479 INFO L87 Difference]: Start difference. First operand 1058 states and 4041 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:02,688 INFO L93 Difference]: Finished difference Result 1934 states and 7437 transitions. [2025-04-13 18:04:02,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:04:02,689 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:04:02,689 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:02,715 INFO L225 Difference]: With dead ends: 1934 [2025-04-13 18:04:02,715 INFO L226 Difference]: Without dead ends: 1928 [2025-04-13 18:04:02,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:04:02,716 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:02,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-04-13 18:04:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1362. [2025-04-13 18:04:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1361 states have (on average 4.002204261572373) internal successors, (5447), 1361 states have internal predecessors, (5447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 5447 transitions. [2025-04-13 18:04:02,753 INFO L79 Accepts]: Start accepts. Automaton has 1362 states and 5447 transitions. Word has length 26 [2025-04-13 18:04:02,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:02,753 INFO L485 AbstractCegarLoop]: Abstraction has 1362 states and 5447 transitions. [2025-04-13 18:04:02,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:02,753 INFO L278 IsEmpty]: Start isEmpty. Operand 1362 states and 5447 transitions. [2025-04-13 18:04:02,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:04:02,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:02,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:02,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 18:04:02,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 18:04:02,961 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:02,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1373079145, now seen corresponding path program 3 times [2025-04-13 18:04:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:02,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912530066] [2025-04-13 18:04:02,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:02,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:02,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:02,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:04:02,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:03,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:03,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912530066] [2025-04-13 18:04:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912530066] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:03,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461642447] [2025-04-13 18:04:03,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:03,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:03,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:03,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:04:03,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 18:04:03,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:03,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:03,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:04:03,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:03,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:04:03,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:03,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461642447] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:03,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:03,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 18:04:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955821787] [2025-04-13 18:04:03,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:03,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:04:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:03,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:04:03,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:04:03,209 INFO L87 Difference]: Start difference. First operand 1362 states and 5447 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:03,470 INFO L93 Difference]: Finished difference Result 2374 states and 9307 transitions. [2025-04-13 18:04:03,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:04:03,471 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:04:03,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:03,483 INFO L225 Difference]: With dead ends: 2374 [2025-04-13 18:04:03,483 INFO L226 Difference]: Without dead ends: 2368 [2025-04-13 18:04:03,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:04:03,484 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:03,484 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2025-04-13 18:04:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 1074. [2025-04-13 18:04:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 3.8182665424044733) internal successors, (4097), 1073 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 4097 transitions. [2025-04-13 18:04:03,514 INFO L79 Accepts]: Start accepts. Automaton has 1074 states and 4097 transitions. Word has length 26 [2025-04-13 18:04:03,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:03,514 INFO L485 AbstractCegarLoop]: Abstraction has 1074 states and 4097 transitions. [2025-04-13 18:04:03,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:03,514 INFO L278 IsEmpty]: Start isEmpty. Operand 1074 states and 4097 transitions. [2025-04-13 18:04:03,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:04:03,517 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:03,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:03,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:03,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:03,721 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:03,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1534990327, now seen corresponding path program 4 times [2025-04-13 18:04:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:03,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166815025] [2025-04-13 18:04:03,724 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:03,731 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:03,736 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:03,736 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:04:03,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:03,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166815025] [2025-04-13 18:04:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166815025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:03,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041020977] [2025-04-13 18:04:03,821 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:03,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:03,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:03,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:04:03,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 18:04:03,860 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:03,876 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:03,877 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:04:03,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:03,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:04:03,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:03,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041020977] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:03,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 18:04:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253250389] [2025-04-13 18:04:03,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:03,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:04:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:03,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:04:03,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:04:03,943 INFO L87 Difference]: Start difference. First operand 1074 states and 4097 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:04,200 INFO L93 Difference]: Finished difference Result 2168 states and 8316 transitions. [2025-04-13 18:04:04,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:04:04,200 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:04:04,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:04,211 INFO L225 Difference]: With dead ends: 2168 [2025-04-13 18:04:04,211 INFO L226 Difference]: Without dead ends: 2162 [2025-04-13 18:04:04,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:04:04,212 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:04,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2025-04-13 18:04:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1538. [2025-04-13 18:04:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 3.9655172413793105) internal successors, (6095), 1537 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 6095 transitions. [2025-04-13 18:04:04,247 INFO L79 Accepts]: Start accepts. Automaton has 1538 states and 6095 transitions. Word has length 26 [2025-04-13 18:04:04,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:04,247 INFO L485 AbstractCegarLoop]: Abstraction has 1538 states and 6095 transitions. [2025-04-13 18:04:04,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:04,247 INFO L278 IsEmpty]: Start isEmpty. Operand 1538 states and 6095 transitions. [2025-04-13 18:04:04,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:04:04,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:04,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:04,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:04:04,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:04,453 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:04,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash -5993469, now seen corresponding path program 5 times [2025-04-13 18:04:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:04,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037578900] [2025-04-13 18:04:04,454 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:04,459 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:04,464 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:04,464 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:04,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:04,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037578900] [2025-04-13 18:04:04,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037578900] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:04,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011822630] [2025-04-13 18:04:04,551 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:04,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:04,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:04:04,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 18:04:04,594 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:04,611 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:04,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:04,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:04,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:04:04,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:04,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011822630] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:04,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 18:04:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604266095] [2025-04-13 18:04:04,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:04,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:04:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:04,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:04:04,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:04:04,670 INFO L87 Difference]: Start difference. First operand 1538 states and 6095 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:04,940 INFO L93 Difference]: Finished difference Result 3086 states and 12280 transitions. [2025-04-13 18:04:04,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:04:04,940 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:04:04,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:04,961 INFO L225 Difference]: With dead ends: 3086 [2025-04-13 18:04:04,963 INFO L226 Difference]: Without dead ends: 3080 [2025-04-13 18:04:04,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:04:04,965 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:04,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2025-04-13 18:04:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 1874. [2025-04-13 18:04:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1873 states have (on average 4.253603844100374) internal successors, (7967), 1873 states have internal predecessors, (7967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 7967 transitions. [2025-04-13 18:04:05,010 INFO L79 Accepts]: Start accepts. Automaton has 1874 states and 7967 transitions. Word has length 26 [2025-04-13 18:04:05,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:05,010 INFO L485 AbstractCegarLoop]: Abstraction has 1874 states and 7967 transitions. [2025-04-13 18:04:05,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:05,011 INFO L278 IsEmpty]: Start isEmpty. Operand 1874 states and 7967 transitions. [2025-04-13 18:04:05,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:04:05,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:05,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:05,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:05,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 18:04:05,216 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:05,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 315614663, now seen corresponding path program 6 times [2025-04-13 18:04:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:05,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068797099] [2025-04-13 18:04:05,217 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:05,223 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:05,235 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:05,235 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:04:05,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:05,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068797099] [2025-04-13 18:04:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068797099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:05,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978118044] [2025-04-13 18:04:05,357 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:05,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:05,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:05,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:04:05,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 18:04:05,402 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:04:05,421 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:04:05,421 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:04:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:05,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:04:05,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:05,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978118044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:05,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-13 18:04:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838026820] [2025-04-13 18:04:05,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:05,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:04:05,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:05,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:04:05,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:04:05,484 INFO L87 Difference]: Start difference. First operand 1874 states and 7967 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:05,813 INFO L93 Difference]: Finished difference Result 2930 states and 11987 transitions. [2025-04-13 18:04:05,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:04:05,813 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:04:05,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:05,823 INFO L225 Difference]: With dead ends: 2930 [2025-04-13 18:04:05,823 INFO L226 Difference]: Without dead ends: 2924 [2025-04-13 18:04:05,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:04:05,825 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:05,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2025-04-13 18:04:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1110. [2025-04-13 18:04:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 3.8133453561767356) internal successors, (4229), 1109 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 4229 transitions. [2025-04-13 18:04:05,854 INFO L79 Accepts]: Start accepts. Automaton has 1110 states and 4229 transitions. Word has length 26 [2025-04-13 18:04:05,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:05,855 INFO L485 AbstractCegarLoop]: Abstraction has 1110 states and 4229 transitions. [2025-04-13 18:04:05,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:05,855 INFO L278 IsEmpty]: Start isEmpty. Operand 1110 states and 4229 transitions. [2025-04-13 18:04:05,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:04:05,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:05,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:05,863 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 18:04:06,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:06,062 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:06,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2003976310, now seen corresponding path program 7 times [2025-04-13 18:04:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:06,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798202166] [2025-04-13 18:04:06,062 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:06,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:04:06,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:04:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:04:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:06,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798202166] [2025-04-13 18:04:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798202166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:04:06,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031506485] [2025-04-13 18:04:06,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:06,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:04:06,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:06,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:04:06,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:06,125 INFO L87 Difference]: Start difference. First operand 1110 states and 4229 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:06,172 INFO L93 Difference]: Finished difference Result 1497 states and 5758 transitions. [2025-04-13 18:04:06,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:04:06,172 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:04:06,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:06,177 INFO L225 Difference]: With dead ends: 1497 [2025-04-13 18:04:06,177 INFO L226 Difference]: Without dead ends: 1078 [2025-04-13 18:04:06,177 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:06,178 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:06,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:04:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-04-13 18:04:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2025-04-13 18:04:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 3.6861652739090065) internal successors, (3970), 1077 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3970 transitions. [2025-04-13 18:04:06,200 INFO L79 Accepts]: Start accepts. Automaton has 1078 states and 3970 transitions. Word has length 28 [2025-04-13 18:04:06,200 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:06,200 INFO L485 AbstractCegarLoop]: Abstraction has 1078 states and 3970 transitions. [2025-04-13 18:04:06,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,201 INFO L278 IsEmpty]: Start isEmpty. Operand 1078 states and 3970 transitions. [2025-04-13 18:04:06,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:04:06,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:06,203 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:06,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:04:06,204 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:06,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1012842369, now seen corresponding path program 1 times [2025-04-13 18:04:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:06,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710428828] [2025-04-13 18:04:06,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:04:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:06,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:04:06,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:04:06,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:06,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:04:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:06,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710428828] [2025-04-13 18:04:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710428828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:06,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:06,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:04:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201766965] [2025-04-13 18:04:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:06,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:04:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:06,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:04:06,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:06,276 INFO L87 Difference]: Start difference. First operand 1078 states and 3970 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:06,322 INFO L93 Difference]: Finished difference Result 1466 states and 5420 transitions. [2025-04-13 18:04:06,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:04:06,322 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:04:06,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:06,325 INFO L225 Difference]: With dead ends: 1466 [2025-04-13 18:04:06,325 INFO L226 Difference]: Without dead ends: 922 [2025-04-13 18:04:06,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:06,326 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:06,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:04:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-04-13 18:04:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-04-13 18:04:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 3.561346362649294) internal successors, (3280), 921 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3280 transitions. [2025-04-13 18:04:06,346 INFO L79 Accepts]: Start accepts. Automaton has 922 states and 3280 transitions. Word has length 28 [2025-04-13 18:04:06,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:06,347 INFO L485 AbstractCegarLoop]: Abstraction has 922 states and 3280 transitions. [2025-04-13 18:04:06,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,347 INFO L278 IsEmpty]: Start isEmpty. Operand 922 states and 3280 transitions. [2025-04-13 18:04:06,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:04:06,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:06,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:06,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:04:06,349 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:04:06,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1527522916, now seen corresponding path program 8 times [2025-04-13 18:04:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:06,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815357683] [2025-04-13 18:04:06,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:06,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:06,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:04:06,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:04:06,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:06,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:04:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:06,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815357683] [2025-04-13 18:04:06,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815357683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:06,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:06,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:04:06,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434259843] [2025-04-13 18:04:06,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:06,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:04:06,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:06,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:04:06,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:06,417 INFO L87 Difference]: Start difference. First operand 922 states and 3280 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:06,458 INFO L93 Difference]: Finished difference Result 922 states and 3280 transitions. [2025-04-13 18:04:06,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:04:06,458 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:04:06,458 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:06,459 INFO L225 Difference]: With dead ends: 922 [2025-04-13 18:04:06,459 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 18:04:06,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:04:06,460 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:06,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:04:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 18:04:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 18:04:06,461 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 18:04:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 18:04:06,463 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-04-13 18:04:06,463 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:06,463 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 18:04:06,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,463 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 18:04:06,463 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 18:04:06,465 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:04:06,465 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:04:06,465 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:04:06,465 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:04:06,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:04:06,467 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:06,469 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:04:06,469 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:04:06,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:04:06 BasicIcfg [2025-04-13 18:04:06,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:04:06,471 INFO L158 Benchmark]: Toolchain (without parser) took 8163.40ms. Allocated memory was 142.6MB in the beginning and 339.7MB in the end (delta: 197.1MB). Free memory was 100.0MB in the beginning and 230.3MB in the end (delta: -130.3MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2025-04-13 18:04:06,471 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 83.6MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:04:06,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.47ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 18:04:06,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.73ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.6MB in the end (delta: 870.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:04:06,472 INFO L158 Benchmark]: Boogie Preprocessor took 53.55ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:04:06,472 INFO L158 Benchmark]: RCFGBuilder took 449.06ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 44.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 18:04:06,472 INFO L158 Benchmark]: TraceAbstraction took 7454.92ms. Allocated memory was 142.6MB in the beginning and 339.7MB in the end (delta: 197.1MB). Free memory was 44.1MB in the beginning and 230.3MB in the end (delta: -186.1MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2025-04-13 18:04:06,473 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 155.2MB. Free memory was 83.8MB in the beginning and 83.6MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.47ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.73ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.6MB in the end (delta: 870.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 53.55ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 449.06ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 44.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7454.92ms. Allocated memory was 142.6MB in the beginning and 339.7MB in the end (delta: 197.1MB). Free memory was 44.1MB in the beginning and 230.3MB in the end (delta: -186.1MB). Peak memory consumption was 10.3MB. 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: 113]: 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 7 procedures, 48 locations, 75 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3822 IncrementalHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 44 mSDtfsCounter, 3822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1874occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 6424 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 1906 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1068 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 16/37 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 18:04:06,487 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...