./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-93.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1467811049c05ec7377b6fa221b52c450a03a13fbec25eef834ca5f9abfca523 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:41:47,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:41:48,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:41:48,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:41:48,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:41:48,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:41:48,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:41:48,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:41:48,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:41:48,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:41:48,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:41:48,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:41:48,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:41:48,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:41:48,049 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:41:48,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:41:48,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:41:48,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:41:48,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:41:48,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:41:48,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:41:48,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:41:48,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:41:48,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:41:48,054 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1467811049c05ec7377b6fa221b52c450a03a13fbec25eef834ca5f9abfca523 [2025-02-05 21:41:48,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:41:48,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:41:48,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:41:48,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:41:48,371 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:41:48,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-93.i [2025-02-05 21:41:49,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/492fe2e45/2891c843856348d6889ebfc13f888d81/FLAGebd403285 [2025-02-05 21:41:50,001 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:41:50,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-93.i [2025-02-05 21:41:50,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/492fe2e45/2891c843856348d6889ebfc13f888d81/FLAGebd403285 [2025-02-05 21:41:50,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/492fe2e45/2891c843856348d6889ebfc13f888d81 [2025-02-05 21:41:50,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:41:50,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:41:50,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:41:50,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:41:50,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:41:50,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1629b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50, skipping insertion in model container [2025-02-05 21:41:50,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:41:50,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-93.i[916,929] [2025-02-05 21:41:50,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:41:50,413 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:41:50,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-93.i[916,929] [2025-02-05 21:41:50,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:41:50,532 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:41:50,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50 WrapperNode [2025-02-05 21:41:50,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:41:50,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:41:50,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:41:50,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:41:50,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,642 INFO L138 Inliner]: procedures = 26, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 646 [2025-02-05 21:41:50,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:41:50,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:41:50,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:41:50,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:41:50,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,705 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-02-05 21:41:50,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:41:50,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:41:50,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:41:50,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:41:50,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (1/1) ... [2025-02-05 21:41:50,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:41:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:50,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:41:50,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:41:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:41:50,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:41:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:41:50,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:41:50,975 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:41:50,977 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:41:51,892 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-05 21:41:51,893 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:41:51,930 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:41:51,931 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:41:51,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:41:51 BoogieIcfgContainer [2025-02-05 21:41:51,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:41:51,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:41:51,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:41:51,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:41:51,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:41:50" (1/3) ... [2025-02-05 21:41:51,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725ed04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:41:51, skipping insertion in model container [2025-02-05 21:41:51,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:50" (2/3) ... [2025-02-05 21:41:51,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725ed04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:41:51, skipping insertion in model container [2025-02-05 21:41:51,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:41:51" (3/3) ... [2025-02-05 21:41:51,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-93.i [2025-02-05 21:41:51,952 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:41:51,955 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-93.i that has 2 procedures, 272 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:41:52,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:41:52,027 INFO L333 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=PETRI_NET, 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;@27101b2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:41:52,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:41:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 164 states have (on average 1.4573170731707317) internal successors, (239), 165 states have internal predecessors, (239), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 21:41:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-02-05 21:41:52,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:52,075 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:52,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:52,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1267752055, now seen corresponding path program 1 times [2025-02-05 21:41:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143025192] [2025-02-05 21:41:52,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:52,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:52,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:41:52,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:41:52,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:52,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-02-05 21:41:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143025192] [2025-02-05 21:41:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143025192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025537300] [2025-02-05 21:41:52,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:52,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:52,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:41:52,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:41:53,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:41:53,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:41:53,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:53,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:53,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:41:53,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-02-05 21:41:53,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:41:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025537300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:41:53,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:41:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424951040] [2025-02-05 21:41:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:53,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:41:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:53,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:41:53,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:41:53,426 INFO L87 Difference]: Start difference. First operand has 272 states, 164 states have (on average 1.4573170731707317) internal successors, (239), 165 states have internal predecessors, (239), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-02-05 21:41:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:53,511 INFO L93 Difference]: Finished difference Result 538 states and 998 transitions. [2025-02-05 21:41:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:41:53,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) Word has length 638 [2025-02-05 21:41:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:53,529 INFO L225 Difference]: With dead ends: 538 [2025-02-05 21:41:53,530 INFO L226 Difference]: Without dead ends: 269 [2025-02-05 21:41:53,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:41:53,542 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:53,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-05 21:41:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-02-05 21:41:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 162 states have internal predecessors, (234), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 21:41:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 444 transitions. [2025-02-05 21:41:53,626 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 444 transitions. Word has length 638 [2025-02-05 21:41:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:53,626 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 444 transitions. [2025-02-05 21:41:53,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-02-05 21:41:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 444 transitions. [2025-02-05 21:41:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-02-05 21:41:53,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:53,641 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:53,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:41:53,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:41:53,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:53,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1075512400, now seen corresponding path program 1 times [2025-02-05 21:41:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962661151] [2025-02-05 21:41:53,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:53,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:41:54,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:41:54,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-02-05 21:41:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962661151] [2025-02-05 21:41:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962661151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:54,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:54,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110266641] [2025-02-05 21:41:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:54,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:54,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:54,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:54,515 INFO L87 Difference]: Start difference. First operand 269 states and 444 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:54,624 INFO L93 Difference]: Finished difference Result 707 states and 1162 transitions. [2025-02-05 21:41:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 638 [2025-02-05 21:41:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:54,634 INFO L225 Difference]: With dead ends: 707 [2025-02-05 21:41:54,634 INFO L226 Difference]: Without dead ends: 441 [2025-02-05 21:41:54,635 INFO L434 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-02-05 21:41:54,636 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 270 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:54,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 859 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-02-05 21:41:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 438. [2025-02-05 21:41:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 252 states have (on average 1.3968253968253967) internal successors, (352), 253 states have internal predecessors, (352), 183 states have call successors, (183), 2 states have call predecessors, (183), 2 states have return successors, (183), 182 states have call predecessors, (183), 183 states have call successors, (183) [2025-02-05 21:41:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 718 transitions. [2025-02-05 21:41:54,741 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 718 transitions. Word has length 638 [2025-02-05 21:41:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:54,744 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 718 transitions. [2025-02-05 21:41:54,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 718 transitions. [2025-02-05 21:41:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-02-05 21:41:54,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:54,752 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:54,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:41:54,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:54,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1181398607, now seen corresponding path program 1 times [2025-02-05 21:41:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975072264] [2025-02-05 21:41:54,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:54,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:41:54,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:41:54,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:54,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-02-05 21:41:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975072264] [2025-02-05 21:41:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975072264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:55,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094892588] [2025-02-05 21:41:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:55,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:55,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:55,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:55,185 INFO L87 Difference]: Start difference. First operand 438 states and 718 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:55,326 INFO L93 Difference]: Finished difference Result 1292 states and 2120 transitions. [2025-02-05 21:41:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 638 [2025-02-05 21:41:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:55,342 INFO L225 Difference]: With dead ends: 1292 [2025-02-05 21:41:55,342 INFO L226 Difference]: Without dead ends: 857 [2025-02-05 21:41:55,348 INFO L434 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-02-05 21:41:55,349 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 432 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:55,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 857 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-05 21:41:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 855. [2025-02-05 21:41:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 484 states have (on average 1.384297520661157) internal successors, (670), 486 states have internal predecessors, (670), 366 states have call successors, (366), 4 states have call predecessors, (366), 4 states have return successors, (366), 364 states have call predecessors, (366), 366 states have call successors, (366) [2025-02-05 21:41:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1402 transitions. [2025-02-05 21:41:55,594 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1402 transitions. Word has length 638 [2025-02-05 21:41:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:55,596 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1402 transitions. [2025-02-05 21:41:55,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1402 transitions. [2025-02-05 21:41:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-02-05 21:41:55,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:55,605 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:41:55,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1392749520, now seen corresponding path program 1 times [2025-02-05 21:41:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644269647] [2025-02-05 21:41:55,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:55,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:41:55,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:41:55,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:55,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-02-05 21:41:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644269647] [2025-02-05 21:41:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644269647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:55,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:55,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730894081] [2025-02-05 21:41:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:55,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:55,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:55,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:55,945 INFO L87 Difference]: Start difference. First operand 855 states and 1402 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:56,097 INFO L93 Difference]: Finished difference Result 2120 states and 3459 transitions. [2025-02-05 21:41:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:56,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 638 [2025-02-05 21:41:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:56,113 INFO L225 Difference]: With dead ends: 2120 [2025-02-05 21:41:56,113 INFO L226 Difference]: Without dead ends: 1268 [2025-02-05 21:41:56,118 INFO L434 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-02-05 21:41:56,120 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 218 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:56,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 855 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-02-05 21:41:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1262. [2025-02-05 21:41:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 759 states have (on average 1.3978919631093545) internal successors, (1061), 765 states have internal predecessors, (1061), 494 states have call successors, (494), 8 states have call predecessors, (494), 8 states have return successors, (494), 488 states have call predecessors, (494), 494 states have call successors, (494) [2025-02-05 21:41:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2049 transitions. [2025-02-05 21:41:56,323 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2049 transitions. Word has length 638 [2025-02-05 21:41:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:56,324 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 2049 transitions. [2025-02-05 21:41:56,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2049 transitions. [2025-02-05 21:41:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-02-05 21:41:56,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:56,330 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:56,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:41:56,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:56,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash 548277649, now seen corresponding path program 1 times [2025-02-05 21:41:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165730579] [2025-02-05 21:41:56,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:56,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 21:41:56,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 21:41:56,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:56,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-02-05 21:41:56,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165730579] [2025-02-05 21:41:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165730579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:56,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:56,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:56,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616884887] [2025-02-05 21:41:56,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:56,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:56,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:56,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:56,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:56,603 INFO L87 Difference]: Start difference. First operand 1262 states and 2049 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:56,736 INFO L93 Difference]: Finished difference Result 2763 states and 4440 transitions. [2025-02-05 21:41:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 638 [2025-02-05 21:41:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:56,751 INFO L225 Difference]: With dead ends: 2763 [2025-02-05 21:41:56,752 INFO L226 Difference]: Without dead ends: 1504 [2025-02-05 21:41:56,758 INFO L434 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-02-05 21:41:56,759 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 37 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 850 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:41:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-02-05 21:41:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1494. [2025-02-05 21:41:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 951 states have (on average 1.3764458464773923) internal successors, (1309), 965 states have internal predecessors, (1309), 526 states have call successors, (526), 16 states have call predecessors, (526), 16 states have return successors, (526), 512 states have call predecessors, (526), 526 states have call successors, (526) [2025-02-05 21:41:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2361 transitions. [2025-02-05 21:41:56,949 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2361 transitions. Word has length 638 [2025-02-05 21:41:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:56,953 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 2361 transitions. [2025-02-05 21:41:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2361 transitions. [2025-02-05 21:41:56,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:41:56,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:56,961 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:56,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:41:56,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1850622025, now seen corresponding path program 1 times [2025-02-05 21:41:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324963295] [2025-02-05 21:41:56,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:57,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:41:57,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:41:57,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:57,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-02-05 21:41:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324963295] [2025-02-05 21:41:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324963295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920772372] [2025-02-05 21:41:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:57,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:57,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:57,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:57,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:57,565 INFO L87 Difference]: Start difference. First operand 1494 states and 2361 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:57,889 INFO L93 Difference]: Finished difference Result 4476 states and 7077 transitions. [2025-02-05 21:41:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 639 [2025-02-05 21:41:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:57,921 INFO L225 Difference]: With dead ends: 4476 [2025-02-05 21:41:57,922 INFO L226 Difference]: Without dead ends: 2985 [2025-02-05 21:41:57,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:57,932 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 262 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:57,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 833 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:41:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2025-02-05 21:41:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2983. [2025-02-05 21:41:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 1898 states have (on average 1.375658587987355) internal successors, (2611), 1926 states have internal predecessors, (2611), 1052 states have call successors, (1052), 32 states have call predecessors, (1052), 32 states have return successors, (1052), 1024 states have call predecessors, (1052), 1052 states have call successors, (1052) [2025-02-05 21:41:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4715 transitions. [2025-02-05 21:41:58,403 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4715 transitions. Word has length 639 [2025-02-05 21:41:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:58,404 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4715 transitions. [2025-02-05 21:41:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-02-05 21:41:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4715 transitions. [2025-02-05 21:41:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:41:58,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:58,411 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:58,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:41:58,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:58,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1521661688, now seen corresponding path program 1 times [2025-02-05 21:41:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:58,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929816546] [2025-02-05 21:41:58,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:58,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:41:58,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:41:58,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:58,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 111 proven. 201 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:41:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929816546] [2025-02-05 21:41:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929816546] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026105827] [2025-02-05 21:41:59,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:59,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:59,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:59,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:41:59,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:41:59,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:41:59,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:41:59,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:59,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:59,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:41:59,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 10518 proven. 189 refuted. 0 times theorem prover too weak. 11133 trivial. 0 not checked. [2025-02-05 21:42:00,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 123 proven. 189 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:42:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026105827] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:01,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:42:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:42:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493038663] [2025-02-05 21:42:01,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:01,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:42:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:01,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:42:01,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:42:01,511 INFO L87 Difference]: Start difference. First operand 2983 states and 4715 transitions. Second operand has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 3 states have call successors, (235), 2 states have call predecessors, (235), 4 states have return successors, (237), 3 states have call predecessors, (237), 3 states have call successors, (237) [2025-02-05 21:42:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:02,630 INFO L93 Difference]: Finished difference Result 6091 states and 9539 transitions. [2025-02-05 21:42:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:42:02,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 3 states have call successors, (235), 2 states have call predecessors, (235), 4 states have return successors, (237), 3 states have call predecessors, (237), 3 states have call successors, (237) Word has length 639 [2025-02-05 21:42:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:02,664 INFO L225 Difference]: With dead ends: 6091 [2025-02-05 21:42:02,664 INFO L226 Difference]: Without dead ends: 3111 [2025-02-05 21:42:02,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1292 GetRequests, 1275 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:42:02,679 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 526 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:02,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 749 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:42:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-02-05 21:42:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3047. [2025-02-05 21:42:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 1946 states have (on average 1.355087358684481) internal successors, (2637), 1974 states have internal predecessors, (2637), 1052 states have call successors, (1052), 48 states have call predecessors, (1052), 48 states have return successors, (1052), 1024 states have call predecessors, (1052), 1052 states have call successors, (1052) [2025-02-05 21:42:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 4741 transitions. [2025-02-05 21:42:03,129 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 4741 transitions. Word has length 639 [2025-02-05 21:42:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:03,130 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 4741 transitions. [2025-02-05 21:42:03,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 3 states have call successors, (235), 2 states have call predecessors, (235), 4 states have return successors, (237), 3 states have call predecessors, (237), 3 states have call successors, (237) [2025-02-05 21:42:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 4741 transitions. [2025-02-05 21:42:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:42:03,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:03,138 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:42:03,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:42:03,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:03,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1176151144, now seen corresponding path program 1 times [2025-02-05 21:42:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604448487] [2025-02-05 21:42:03,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:03,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:42:03,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:42:03,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:03,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 102 proven. 210 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:42:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604448487] [2025-02-05 21:42:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604448487] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056349957] [2025-02-05 21:42:04,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:04,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:04,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:04,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:42:04,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:42:04,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:42:04,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:42:04,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:04,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:04,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 21:42:04,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 9692 proven. 210 refuted. 0 times theorem prover too weak. 11938 trivial. 0 not checked. [2025-02-05 21:42:07,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 102 proven. 210 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:42:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056349957] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:08,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:42:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2025-02-05 21:42:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711047040] [2025-02-05 21:42:08,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:08,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 21:42:08,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:08,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 21:42:08,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:42:08,336 INFO L87 Difference]: Start difference. First operand 3047 states and 4741 transitions. Second operand has 19 states, 19 states have (on average 14.263157894736842) internal successors, (271), 19 states have internal predecessors, (271), 5 states have call successors, (280), 3 states have call predecessors, (280), 6 states have return successors, (281), 5 states have call predecessors, (281), 5 states have call successors, (281) [2025-02-05 21:42:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:15,903 INFO L93 Difference]: Finished difference Result 14789 states and 22769 transitions. [2025-02-05 21:42:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-02-05 21:42:15,904 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.263157894736842) internal successors, (271), 19 states have internal predecessors, (271), 5 states have call successors, (280), 3 states have call predecessors, (280), 6 states have return successors, (281), 5 states have call predecessors, (281), 5 states have call successors, (281) Word has length 639 [2025-02-05 21:42:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:16,003 INFO L225 Difference]: With dead ends: 14789 [2025-02-05 21:42:16,003 INFO L226 Difference]: Without dead ends: 11697 [2025-02-05 21:42:16,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1369 GetRequests, 1278 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3191 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1536, Invalid=7020, Unknown=0, NotChecked=0, Total=8556 [2025-02-05 21:42:16,024 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 3244 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 4106 mSolverCounterSat, 2621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3450 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 6727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2621 IncrementalHoareTripleChecker+Valid, 4106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:16,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3450 Valid, 4475 Invalid, 6727 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2621 Valid, 4106 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-05 21:42:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11697 states. [2025-02-05 21:42:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11697 to 11427. [2025-02-05 21:42:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11427 states, 7406 states have (on average 1.354577369700243) internal successors, (10032), 7494 states have internal predecessors, (10032), 3776 states have call successors, (3776), 244 states have call predecessors, (3776), 244 states have return successors, (3776), 3688 states have call predecessors, (3776), 3776 states have call successors, (3776) [2025-02-05 21:42:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11427 states to 11427 states and 17584 transitions. [2025-02-05 21:42:17,784 INFO L78 Accepts]: Start accepts. Automaton has 11427 states and 17584 transitions. Word has length 639 [2025-02-05 21:42:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:17,786 INFO L471 AbstractCegarLoop]: Abstraction has 11427 states and 17584 transitions. [2025-02-05 21:42:17,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.263157894736842) internal successors, (271), 19 states have internal predecessors, (271), 5 states have call successors, (280), 3 states have call predecessors, (280), 6 states have return successors, (281), 5 states have call predecessors, (281), 5 states have call successors, (281) [2025-02-05 21:42:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11427 states and 17584 transitions. [2025-02-05 21:42:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:42:17,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:17,806 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:42:17,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 21:42:18,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:18,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:18,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:18,011 INFO L85 PathProgramCache]: Analyzing trace with hash 935139225, now seen corresponding path program 1 times [2025-02-05 21:42:18,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:18,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184861138] [2025-02-05 21:42:18,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:18,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:18,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:42:18,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:42:18,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:18,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 225 proven. 87 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:42:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184861138] [2025-02-05 21:42:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184861138] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767973668] [2025-02-05 21:42:18,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:18,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:19,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:42:19,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 21:42:19,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:42:19,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:42:19,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:19,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:19,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:42:19,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 11979 proven. 51 refuted. 0 times theorem prover too weak. 9810 trivial. 0 not checked. [2025-02-05 21:42:19,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 261 proven. 51 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:42:20,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767973668] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:20,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:42:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-02-05 21:42:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804897294] [2025-02-05 21:42:20,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:42:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:20,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:42:20,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:42:20,489 INFO L87 Difference]: Start difference. First operand 11427 states and 17584 transitions. Second operand has 16 states, 16 states have (on average 13.875) internal successors, (222), 16 states have internal predecessors, (222), 6 states have call successors, (185), 3 states have call predecessors, (185), 6 states have return successors, (185), 6 states have call predecessors, (185), 6 states have call successors, (185) [2025-02-05 21:42:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:24,193 INFO L93 Difference]: Finished difference Result 33081 states and 50087 transitions. [2025-02-05 21:42:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 21:42:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 13.875) internal successors, (222), 16 states have internal predecessors, (222), 6 states have call successors, (185), 3 states have call predecessors, (185), 6 states have return successors, (185), 6 states have call predecessors, (185), 6 states have call successors, (185) Word has length 639 [2025-02-05 21:42:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:24,344 INFO L225 Difference]: With dead ends: 33081 [2025-02-05 21:42:24,344 INFO L226 Difference]: Without dead ends: 21657 [2025-02-05 21:42:24,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=335, Invalid=787, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 21:42:24,401 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 2151 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 2165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 3759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2165 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:24,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 1492 Invalid, 3759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2165 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 21:42:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21657 states. [2025-02-05 21:42:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21657 to 16766. [2025-02-05 21:42:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16766 states, 10967 states have (on average 1.339108233792286) internal successors, (14686), 11107 states have internal predecessors, (14686), 5368 states have call successors, (5368), 430 states have call predecessors, (5368), 430 states have return successors, (5368), 5228 states have call predecessors, (5368), 5368 states have call successors, (5368) [2025-02-05 21:42:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16766 states to 16766 states and 25422 transitions. [2025-02-05 21:42:26,744 INFO L78 Accepts]: Start accepts. Automaton has 16766 states and 25422 transitions. Word has length 639 [2025-02-05 21:42:26,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:26,745 INFO L471 AbstractCegarLoop]: Abstraction has 16766 states and 25422 transitions. [2025-02-05 21:42:26,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.875) internal successors, (222), 16 states have internal predecessors, (222), 6 states have call successors, (185), 3 states have call predecessors, (185), 6 states have return successors, (185), 6 states have call predecessors, (185), 6 states have call successors, (185) [2025-02-05 21:42:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 16766 states and 25422 transitions. [2025-02-05 21:42:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:42:26,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:26,758 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:42:26,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 21:42:26,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 21:42:26,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:26,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:26,960 INFO L85 PathProgramCache]: Analyzing trace with hash -448968421, now seen corresponding path program 1 times [2025-02-05 21:42:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:26,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476152473] [2025-02-05 21:42:26,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:26,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:42:27,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:42:27,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:27,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-02-05 21:42:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476152473] [2025-02-05 21:42:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476152473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:42:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873813547] [2025-02-05 21:42:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:28,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:42:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:28,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:42:28,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:42:28,262 INFO L87 Difference]: Start difference. First operand 16766 states and 25422 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 4 states have call predecessors, (105), 4 states have call successors, (105) [2025-02-05 21:42:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:33,704 INFO L93 Difference]: Finished difference Result 61635 states and 92603 transitions. [2025-02-05 21:42:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:42:33,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 4 states have call predecessors, (105), 4 states have call successors, (105) Word has length 639 [2025-02-05 21:42:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:33,945 INFO L225 Difference]: With dead ends: 61635 [2025-02-05 21:42:33,946 INFO L226 Difference]: Without dead ends: 44872 [2025-02-05 21:42:34,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:42:34,019 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 2027 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 982 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 982 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:34,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 1148 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [982 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 21:42:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44872 states. [2025-02-05 21:42:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44872 to 44772. [2025-02-05 21:42:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44772 states, 30561 states have (on average 1.3483197539347533) internal successors, (41206), 31013 states have internal predecessors, (41206), 12904 states have call successors, (12904), 1306 states have call predecessors, (12904), 1306 states have return successors, (12904), 12452 states have call predecessors, (12904), 12904 states have call successors, (12904) [2025-02-05 21:42:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44772 states to 44772 states and 67014 transitions. [2025-02-05 21:42:39,232 INFO L78 Accepts]: Start accepts. Automaton has 44772 states and 67014 transitions. Word has length 639 [2025-02-05 21:42:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:39,233 INFO L471 AbstractCegarLoop]: Abstraction has 44772 states and 67014 transitions. [2025-02-05 21:42:39,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 4 states have call predecessors, (105), 4 states have call successors, (105) [2025-02-05 21:42:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 44772 states and 67014 transitions. [2025-02-05 21:42:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:42:39,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:39,260 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:42:39,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:42:39,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:39,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1012611578, now seen corresponding path program 1 times [2025-02-05 21:42:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079517109] [2025-02-05 21:42:39,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:39,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:42:39,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:42:39,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:39,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 225 proven. 87 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:42:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079517109] [2025-02-05 21:42:39,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079517109] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242735004] [2025-02-05 21:42:39,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:39,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:39,799 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:42:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 21:42:40,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:42:40,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:42:40,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:40,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:40,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:42:40,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 8954 proven. 87 refuted. 0 times theorem prover too weak. 12799 trivial. 0 not checked. [2025-02-05 21:42:40,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 225 proven. 87 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-02-05 21:42:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242735004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:40,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:42:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-05 21:42:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270697227] [2025-02-05 21:42:40,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:42:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:40,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:42:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:42:40,875 INFO L87 Difference]: Start difference. First operand 44772 states and 67014 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) [2025-02-05 21:42:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:50,156 INFO L93 Difference]: Finished difference Result 134021 states and 199043 transitions. [2025-02-05 21:42:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 21:42:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 2 states have call successors, (134), 2 states have call predecessors, (134), 4 states have return successors, (135), 2 states have call predecessors, (135), 2 states have call successors, (135) Word has length 639 [2025-02-05 21:42:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:50,741 INFO L225 Difference]: With dead ends: 134021 [2025-02-05 21:42:50,741 INFO L226 Difference]: Without dead ends: 89252 [2025-02-05 21:42:50,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1304 GetRequests, 1277 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2025-02-05 21:42:50,963 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1141 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 861 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 861 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:50,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 1703 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [861 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:42:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89252 states. [2025-02-05 21:42:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89252 to 47101. [2025-02-05 21:42:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47101 states, 32773 states have (on average 1.3415616513593507) internal successors, (43967), 33226 states have internal predecessors, (43967), 13009 states have call successors, (13009), 1318 states have call predecessors, (13009), 1318 states have return successors, (13009), 12556 states have call predecessors, (13009), 13009 states have call successors, (13009)