/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:20:49,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:20:49,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:20:49,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:20:49,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:20:49,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:20:49,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:20:49,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:20:49,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:20:49,804 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:20:49,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:20:49,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:20:49,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:20:49,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:20:49,805 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:20:49,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:20:49,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:20:49,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:20:50,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:20:50,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:20:50,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:20:50,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:20:50,051 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:20:50,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i [2025-04-13 21:20:51,301 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004612ce/4f7fd01adb0f4df289586bb5390a209e/FLAG014329eae [2025-04-13 21:20:51,505 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:20:51,506 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i [2025-04-13 21:20:51,515 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004612ce/4f7fd01adb0f4df289586bb5390a209e/FLAG014329eae [2025-04-13 21:20:53,401 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004612ce/4f7fd01adb0f4df289586bb5390a209e [2025-04-13 21:20:53,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:20:53,404 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:20:53,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:53,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:20:53,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:20:53,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aaaf9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53, skipping insertion in model container [2025-04-13 21:20:53,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:20:53,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2025-04-13 21:20:53,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:53,671 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:20:53,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2025-04-13 21:20:53,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:53,751 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:20:53,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53 WrapperNode [2025-04-13 21:20:53,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:53,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:53,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:20:53,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:20:53,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,785 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 21:20:53,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:53,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:20:53,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:20:53,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:20:53,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,812 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 21:20:53,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:20:53,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:20:53,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:20:53,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:20:53,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (1/1) ... [2025-04-13 21:20:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:53,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:20:53,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:20:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:20:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:20:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:20:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:20:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:20:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:20:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:20:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:20:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:20:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:20:53,884 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:20:53,987 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:20:53,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:20:54,095 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:20:54,096 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:20:54,096 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:20:54,180 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:20:54,182 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:20:54,184 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:20:54,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:20:54 BoogieIcfgContainer [2025-04-13 21:20:54,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:20:54,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:20:54,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:20:54,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:20:54,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:20:53" (1/3) ... [2025-04-13 21:20:54,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e89687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:20:54, skipping insertion in model container [2025-04-13 21:20:54,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:53" (2/3) ... [2025-04-13 21:20:54,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e89687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:20:54, skipping insertion in model container [2025-04-13 21:20:54,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:20:54" (3/3) ... [2025-04-13 21:20:54,191 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i [2025-04-13 21:20:54,199 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:20:54,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-12.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:20:54,200 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:20:54,234 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:20:54,254 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 21:20:54,268 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,285 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:20:54,292 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;@6d0b36ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:20:54,293 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:20:54,296 INFO L278 IsEmpty]: Start isEmpty. Operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,299 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:20:54,300 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:54,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:54,300 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:54,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1578653316, now seen corresponding path program 1 times [2025-04-13 21:20:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:54,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087064578] [2025-04-13 21:20:54,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:54,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:20:54,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:20:54,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:54,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:54,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:54,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087064578] [2025-04-13 21:20:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087064578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:20:54,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:20:54,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:20:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347644705] [2025-04-13 21:20:54,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:20:54,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:20:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:54,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:20:54,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:20:54,526 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 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, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:54,606 INFO L93 Difference]: Finished difference Result 173 states and 570 transitions. [2025-04-13 21:20:54,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:20:54,609 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-04-13 21:20:54,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:54,615 INFO L225 Difference]: With dead ends: 173 [2025-04-13 21:20:54,616 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 21:20:54,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:20:54,624 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:54,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 21:20:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 21:20:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.861111111111111) internal successors, (309), 108 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 309 transitions. [2025-04-13 21:20:54,660 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 309 transitions. Word has length 11 [2025-04-13 21:20:54,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:54,661 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 309 transitions. [2025-04-13 21:20:54,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,661 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 309 transitions. [2025-04-13 21:20:54,662 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:20:54,662 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:54,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:54,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:20:54,662 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:54,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576751, now seen corresponding path program 1 times [2025-04-13 21:20:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:54,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989909215] [2025-04-13 21:20:54,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:54,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:54,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:54,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:20:54,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:54,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,750 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 21:20:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:54,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989909215] [2025-04-13 21:20:54,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989909215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:54,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452094101] [2025-04-13 21:20:54,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:54,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:54,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:54,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:54,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:20:54,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:54,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:20:54,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:20:54,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:54,849 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 21:20:54,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:54,871 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 21:20:54,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452094101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:54,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 21:20:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413948019] [2025-04-13 21:20:54,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:54,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:20:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:54,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:20:54,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:20:54,873 INFO L87 Difference]: Start difference. First operand 109 states and 309 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:54,980 INFO L93 Difference]: Finished difference Result 205 states and 629 transitions. [2025-04-13 21:20:54,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:20:54,981 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 12 [2025-04-13 21:20:54,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:54,982 INFO L225 Difference]: With dead ends: 205 [2025-04-13 21:20:54,982 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 21:20:54,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:20:54,984 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:54,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 21:20:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-13 21:20:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.9038461538461537) internal successors, (453), 156 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 453 transitions. [2025-04-13 21:20:54,999 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 453 transitions. Word has length 12 [2025-04-13 21:20:55,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:55,000 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 453 transitions. [2025-04-13 21:20:55,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,001 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 453 transitions. [2025-04-13 21:20:55,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:20:55,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:55,003 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:55,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:20:55,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:55,208 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:55,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 328624452, now seen corresponding path program 2 times [2025-04-13 21:20:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:55,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10003604] [2025-04-13 21:20:55,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:55,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:55,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:20:55,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:55,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:55,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:55,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10003604] [2025-04-13 21:20:55,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10003604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:55,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565929330] [2025-04-13 21:20:55,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:55,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:55,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:20:55,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:55,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:20:55,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:55,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:20:55,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:55,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565929330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:55,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:55,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 21:20:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257596718] [2025-04-13 21:20:55,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:55,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:20:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:20:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:20:55,485 INFO L87 Difference]: Start difference. First operand 157 states and 453 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:55,640 INFO L93 Difference]: Finished difference Result 301 states and 965 transitions. [2025-04-13 21:20:55,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:20:55,641 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 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 15 [2025-04-13 21:20:55,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:55,643 INFO L225 Difference]: With dead ends: 301 [2025-04-13 21:20:55,643 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 21:20:55,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:20:55,644 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:55,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 21:20:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-13 21:20:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.9404761904761907) internal successors, (741), 252 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 741 transitions. [2025-04-13 21:20:55,674 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 741 transitions. Word has length 15 [2025-04-13 21:20:55,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:55,675 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 741 transitions. [2025-04-13 21:20:55,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,675 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 741 transitions. [2025-04-13 21:20:55,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:20:55,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:55,676 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:55,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:20:55,876 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,SelfDestructingSolverStorable2 [2025-04-13 21:20:55,877 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:55,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2090552988, now seen corresponding path program 3 times [2025-04-13 21:20:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:55,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634117248] [2025-04-13 21:20:55,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:55,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:55,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:20:55,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:55,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:56,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634117248] [2025-04-13 21:20:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634117248] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:56,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728775706] [2025-04-13 21:20:56,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:56,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:56,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:56,070 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:56,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:20:56,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:56,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:20:56,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:56,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:56,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:20:56,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:56,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728775706] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:56,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:56,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 21:20:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994309429] [2025-04-13 21:20:56,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:56,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 21:20:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:56,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 21:20:56,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:20:56,337 INFO L87 Difference]: Start difference. First operand 253 states and 741 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:56,599 INFO L93 Difference]: Finished difference Result 493 states and 1637 transitions. [2025-04-13 21:20:56,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:20:56,600 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 21:20:56,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:56,603 INFO L225 Difference]: With dead ends: 493 [2025-04-13 21:20:56,603 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 21:20:56,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:20:56,607 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:56,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:20:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 21:20:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-04-13 21:20:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.9662162162162162) internal successors, (1317), 444 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1317 transitions. [2025-04-13 21:20:56,642 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1317 transitions. Word has length 21 [2025-04-13 21:20:56,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:56,643 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1317 transitions. [2025-04-13 21:20:56,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:56,644 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1317 transitions. [2025-04-13 21:20:56,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 21:20:56,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:56,650 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:56,656 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 21:20:56,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:56,851 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:56,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1826129500, now seen corresponding path program 4 times [2025-04-13 21:20:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:56,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783070082] [2025-04-13 21:20:56,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:56,861 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:56,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 21:20:56,879 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:56,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:57,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783070082] [2025-04-13 21:20:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783070082] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:57,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515245934] [2025-04-13 21:20:57,234 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:57,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:57,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:57,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:57,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:20:57,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:57,304 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 21:20:57,304 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:57,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 21:20:57,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:57,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515245934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:57,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 28 [2025-04-13 21:20:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100367369] [2025-04-13 21:20:57,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:57,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:20:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:57,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:20:57,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:20:57,648 INFO L87 Difference]: Start difference. First operand 445 states and 1317 transitions. Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:57,943 INFO L93 Difference]: Finished difference Result 557 states and 1701 transitions. [2025-04-13 21:20:57,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 21:20:57,943 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 21:20:57,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:57,947 INFO L225 Difference]: With dead ends: 557 [2025-04-13 21:20:57,947 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 21:20:57,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:20:57,949 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 540 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:57,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:20:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 21:20:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-04-13 21:20:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 2.970472440944882) internal successors, (1509), 508 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1509 transitions. [2025-04-13 21:20:57,973 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1509 transitions. Word has length 33 [2025-04-13 21:20:57,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:57,973 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1509 transitions. [2025-04-13 21:20:57,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:57,973 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1509 transitions. [2025-04-13 21:20:57,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:20:57,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:57,975 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:57,981 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 21:20:58,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:58,179 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:58,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 404683876, now seen corresponding path program 5 times [2025-04-13 21:20:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:58,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444021161] [2025-04-13 21:20:58,180 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:20:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:58,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 21:20:58,268 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:20:58,268 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 21:20:58,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:59,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444021161] [2025-04-13 21:20:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444021161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:59,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270958186] [2025-04-13 21:20:59,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:20:59,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:59,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:59,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:59,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:20:59,919 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 21:20:59,957 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:20:59,957 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 21:20:59,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:59,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-13 21:20:59,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:21:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:01,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:21:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270958186] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:21:02,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:21:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2025-04-13 21:21:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788014917] [2025-04-13 21:21:02,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:21:02,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-04-13 21:21:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:21:02,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-04-13 21:21:02,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=7231, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 21:21:02,932 INFO L87 Difference]: Start difference. First operand 509 states and 1509 transitions. Second operand has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:21:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:21:23,208 INFO L93 Difference]: Finished difference Result 16045 states and 48049 transitions. [2025-04-13 21:21:23,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-04-13 21:21:23,209 INFO L79 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 21:21:23,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:21:23,283 INFO L225 Difference]: With dead ends: 16045 [2025-04-13 21:21:23,283 INFO L226 Difference]: Without dead ends: 15180 [2025-04-13 21:21:23,296 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17115 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=12137, Invalid=43795, Unknown=0, NotChecked=0, Total=55932 [2025-04-13 21:21:23,297 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3750 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6537 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3750 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 6537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:21:23,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3750 Valid, 0 Invalid, 7059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 6537 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 21:21:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15180 states. [2025-04-13 21:21:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15180 to 13356. [2025-04-13 21:21:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13356 states, 13355 states have (on average 3.031748408835642) internal successors, (40489), 13355 states have internal predecessors, (40489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:21:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13356 states to 13356 states and 40489 transitions. [2025-04-13 21:21:24,647 INFO L79 Accepts]: Start accepts. Automaton has 13356 states and 40489 transitions. Word has length 37 [2025-04-13 21:21:24,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:21:24,648 INFO L485 AbstractCegarLoop]: Abstraction has 13356 states and 40489 transitions. [2025-04-13 21:21:24,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:21:24,648 INFO L278 IsEmpty]: Start isEmpty. Operand 13356 states and 40489 transitions. [2025-04-13 21:21:24,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:21:24,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:21:24,665 INFO L218 NwaCegarLoop]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:21:24,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:21:24,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:21:24,867 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:21:24,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:21:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash 930276057, now seen corresponding path program 1 times [2025-04-13 21:21:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:21:24,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292658073] [2025-04-13 21:21:24,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:21:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:21:24,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:21:24,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:21:24,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:21:24,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:21:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:21:26,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292658073] [2025-04-13 21:21:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292658073] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:21:26,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434411718] [2025-04-13 21:21:26,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:21:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:21:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:21:26,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:21:26,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:21:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:21:26,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:21:26,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:21:26,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:21:26,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:21:26,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:21:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 300 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:27,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:21:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:29,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434411718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:21:29,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:21:29,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 21:21:29,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850187382] [2025-04-13 21:21:29,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:21:29,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 21:21:29,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:21:29,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 21:21:29,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1427, Invalid=8673, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 21:21:29,210 INFO L87 Difference]: Start difference. First operand 13356 states and 40489 transitions. Second operand has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:25:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:25:41,876 INFO L93 Difference]: Finished difference Result 266130 states and 831363 transitions. [2025-04-13 21:25:41,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 968 states. [2025-04-13 21:25:41,876 INFO L79 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 21:25:41,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:25:43,160 INFO L225 Difference]: With dead ends: 266130 [2025-04-13 21:25:43,160 INFO L226 Difference]: Without dead ends: 263028 [2025-04-13 21:25:43,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1073 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1059 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566365 ImplicationChecksByTransitivity, 199.5s TimeCoverageRelationStatistics Valid=223475, Invalid=901185, Unknown=0, NotChecked=0, Total=1124660 [2025-04-13 21:25:43,330 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8854 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14938 mSolverCounterSat, 2175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8854 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2175 IncrementalHoareTripleChecker+Valid, 14938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:25:43,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8854 Valid, 0 Invalid, 17113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2175 Valid, 14938 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-04-13 21:25:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263028 states. [2025-04-13 21:26:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263028 to 216908. [2025-04-13 21:26:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216908 states, 216907 states have (on average 3.289631040030981) internal successors, (713544), 216907 states have internal predecessors, (713544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:26:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216908 states to 216908 states and 713544 transitions. [2025-04-13 21:26:16,762 INFO L79 Accepts]: Start accepts. Automaton has 216908 states and 713544 transitions. Word has length 41 [2025-04-13 21:26:16,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:26:16,763 INFO L485 AbstractCegarLoop]: Abstraction has 216908 states and 713544 transitions. [2025-04-13 21:26:16,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:26:16,763 INFO L278 IsEmpty]: Start isEmpty. Operand 216908 states and 713544 transitions. [2025-04-13 21:26:16,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:26:16,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:26:16,919 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:26:16,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 21:26:17,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:26:17,123 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:26:17,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:26:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash 694844726, now seen corresponding path program 1 times [2025-04-13 21:26:17,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:26:17,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227440616] [2025-04-13 21:26:17,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:26:17,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:26:17,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:26:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:26:17,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:26:17,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:26:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:26:18,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:26:18,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227440616] [2025-04-13 21:26:18,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227440616] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:26:18,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289538513] [2025-04-13 21:26:18,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:26:18,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:26:18,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:26:18,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:26:18,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 21:26:18,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:26:18,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:26:18,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:26:18,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:26:18,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:26:18,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:26:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:26:19,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:26:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:26:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289538513] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:26:21,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:26:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2025-04-13 21:26:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337104311] [2025-04-13 21:26:21,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:26:21,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-04-13 21:26:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:26:21,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-04-13 21:26:21,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=8524, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 21:26:21,359 INFO L87 Difference]: Start difference. First operand 216908 states and 713544 transitions. Second operand has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:27:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:27:44,581 INFO L93 Difference]: Finished difference Result 314670 states and 1018156 transitions. [2025-04-13 21:27:44,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2025-04-13 21:27:44,582 INFO L79 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 21:27:44,582 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:27:46,444 INFO L225 Difference]: With dead ends: 314670 [2025-04-13 21:27:46,445 INFO L226 Difference]: Without dead ends: 314434 [2025-04-13 21:27:46,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23572 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=13717, Invalid=61633, Unknown=0, NotChecked=0, Total=75350 [2025-04-13 21:27:46,581 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3062 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10146 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3062 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 10146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:27:46,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3062 Valid, 0 Invalid, 11096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 10146 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 21:27:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314434 states. [2025-04-13 21:28:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314434 to 250731. [2025-04-13 21:28:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250731 states, 250730 states have (on average 3.3768515933474257) internal successors, (846678), 250730 states have internal predecessors, (846678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:28:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250731 states to 250731 states and 846678 transitions. [2025-04-13 21:28:28,677 INFO L79 Accepts]: Start accepts. Automaton has 250731 states and 846678 transitions. Word has length 41 [2025-04-13 21:28:28,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:28:28,678 INFO L485 AbstractCegarLoop]: Abstraction has 250731 states and 846678 transitions. [2025-04-13 21:28:28,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:28:28,678 INFO L278 IsEmpty]: Start isEmpty. Operand 250731 states and 846678 transitions. [2025-04-13 21:28:28,829 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:28:28,829 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:28:28,829 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:28:28,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 21:28:29,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:28:29,030 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:28:29,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:28:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1183224926, now seen corresponding path program 2 times [2025-04-13 21:28:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:28:29,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449873573] [2025-04-13 21:28:29,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:28:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:28:29,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 21:28:29,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:28:29,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:28:29,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:28:30,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449873573] [2025-04-13 21:28:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449873573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:28:30,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405725643] [2025-04-13 21:28:30,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:28:30,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:28:30,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:28:30,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:28:30,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 21:28:30,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 21:28:30,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:28:30,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:28:30,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:30,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:28:30,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:28:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:31,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:28:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405725643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:28:32,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:28:32,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 21:28:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760304878] [2025-04-13 21:28:32,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:28:32,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 21:28:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:28:32,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 21:28:32,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1421, Invalid=8679, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 21:28:32,950 INFO L87 Difference]: Start difference. First operand 250731 states and 846678 transitions. Second operand has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:30:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:30:42,742 INFO L93 Difference]: Finished difference Result 354336 states and 1157118 transitions. [2025-04-13 21:30:42,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2025-04-13 21:30:42,752 INFO L79 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 21:30:42,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:30:46,545 INFO L225 Difference]: With dead ends: 354336 [2025-04-13 21:30:46,549 INFO L226 Difference]: Without dead ends: 354013 [2025-04-13 21:30:46,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29285 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=17110, Invalid=74396, Unknown=0, NotChecked=0, Total=91506 [2025-04-13 21:30:46,930 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11429 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 11429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:30:46,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3191 Valid, 0 Invalid, 12507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 11429 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 21:30:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354013 states. [2025-04-13 21:31:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354013 to 278757. [2025-04-13 21:31:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278757 states, 278756 states have (on average 3.434713512892996) internal successors, (957447), 278756 states have internal predecessors, (957447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:31:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278757 states to 278757 states and 957447 transitions. [2025-04-13 21:31:38,288 INFO L79 Accepts]: Start accepts. Automaton has 278757 states and 957447 transitions. Word has length 41 [2025-04-13 21:31:38,289 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:31:38,289 INFO L485 AbstractCegarLoop]: Abstraction has 278757 states and 957447 transitions. [2025-04-13 21:31:38,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:31:38,289 INFO L278 IsEmpty]: Start isEmpty. Operand 278757 states and 957447 transitions. [2025-04-13 21:31:38,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:31:38,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:31:38,617 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:31:38,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 21:31:38,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 21:31:38,819 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:31:38,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:31:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 17209882, now seen corresponding path program 3 times [2025-04-13 21:31:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:31:38,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574629580] [2025-04-13 21:31:38,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:31:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:31:38,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 14 equivalence classes. [2025-04-13 21:31:39,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:31:39,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-04-13 21:31:39,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:31:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:31:40,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:31:40,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574629580] [2025-04-13 21:31:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574629580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:31:40,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772506572] [2025-04-13 21:31:40,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:31:40,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:31:40,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:31:40,980 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:31:40,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 21:31:41,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 14 equivalence classes. [2025-04-13 21:31:41,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:31:41,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-04-13 21:31:41,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:31:41,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:31:41,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:31:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 300 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:31:42,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:31:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:31:44,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772506572] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:31:44,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:31:44,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 21:31:44,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562880404] [2025-04-13 21:31:44,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:31:44,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 21:31:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:31:44,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 21:31:44,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1418, Invalid=8682, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 21:31:44,426 INFO L87 Difference]: Start difference. First operand 278757 states and 957447 transitions. Second operand has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 21:33:51,491 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:33:51,491 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:33:51,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2025-04-13 21:33:51,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29464 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=18218, Invalid=72684, Unknown=0, NotChecked=0, Total=90902 [2025-04-13 21:33:51,519 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3046 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12994 mSolverCounterSat, 1116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3046 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1116 IncrementalHoareTripleChecker+Valid, 12994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:51,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3046 Valid, 0 Invalid, 14110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1116 Valid, 12994 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 21:33:51,521 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:33:51,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 21:33:51,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 21:33:51,722 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (278757states) and FLOYD_HOARE automaton (currently 209 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (310257 states constructed, input type IntersectNwa). [2025-04-13 21:33:51,728 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:33:51,728 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:33:51,736 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2025-04-13 21:33:51,740 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:33:51,740 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:33:51,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:33:51 BasicIcfg [2025-04-13 21:33:51,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:33:51,752 INFO L158 Benchmark]: Toolchain (without parser) took 778344.51ms. Allocated memory was 142.6MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 101.7MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2025-04-13 21:33:51,752 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:33:51,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.47ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 79.6MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:33:51,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.16ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 77.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:33:51,752 INFO L158 Benchmark]: Boogie Preprocessor took 42.11ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:33:51,753 INFO L158 Benchmark]: IcfgBuilder took 356.81ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 49.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:33:51,753 INFO L158 Benchmark]: TraceAbstraction took 777562.00ms. Allocated memory was 142.6MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 48.6MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2025-04-13 21:33:51,754 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.47ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 79.6MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.16ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 77.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.11ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 356.81ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 49.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 777562.00ms. Allocated memory was 142.6MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 48.6MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (278757states) and FLOYD_HOARE automaton (currently 209 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (310257 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (278757states) and FLOYD_HOARE automaton (currently 209 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (310257 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (278757states) and FLOYD_HOARE automaton (currently 209 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (310257 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 31 locations, 37 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 777.5s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.7s, AutomataDifference: 621.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23059 SdHoareTripleChecker+Valid, 22.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23059 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 19.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5858 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56771 IncrementalHoareTripleChecker+Invalid, 62629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5858 mSolverCounterUnsat, 0 mSDtfsCounter, 56771 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2443 GetRequests, 189 SyntacticMatches, 20 SemanticMatches, 2234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666111 ImplicationChecksByTransitivity, 305.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278757occurred in iteration=9, InterpolantAutomatonStates: 1581, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 127.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 186903 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 10356 SizeOfPredicates, 150 NumberOfNonLiveVariables, 2399 ConjunctsInSsa, 498 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1500/6075 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown