./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-50.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-50.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 6b45ccb3e1d6d85a9c8f7f52288c3291e482bbcbd2ab4e741715d19987b56944 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:36:15,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:36:16,024 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:36:16,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:36:16,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:36:16,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:36:16,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:36:16,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:36:16,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:36:16,057 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:36:16,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:36:16,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:36:16,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:36:16,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:36:16,060 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:36:16,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:36:16,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:36:16,061 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:36:16,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:36:16,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:36:16,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:36:16,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:36:16,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:36:16,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:36:16,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:36:16,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:36:16,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:36:16,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:36:16,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:36:16,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:36:16,063 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 -> 6b45ccb3e1d6d85a9c8f7f52288c3291e482bbcbd2ab4e741715d19987b56944 [2025-02-05 21:36:16,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:36:16,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:36:16,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:36:16,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:36:16,402 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:36:16,404 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-50.i [2025-02-05 21:36:17,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a2cf4fd4/4270d9ffd26345f38417fd943eb4908e/FLAG1451861a4 [2025-02-05 21:36:17,966 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:36:17,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-50.i [2025-02-05 21:36:17,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a2cf4fd4/4270d9ffd26345f38417fd943eb4908e/FLAG1451861a4 [2025-02-05 21:36:18,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a2cf4fd4/4270d9ffd26345f38417fd943eb4908e [2025-02-05 21:36:18,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:36:18,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:36:18,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:36:18,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:36:18,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:36:18,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18, skipping insertion in model container [2025-02-05 21:36:18,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:36:18,203 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-50.i[916,929] [2025-02-05 21:36:18,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:36:18,392 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:36:18,403 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-50.i[916,929] [2025-02-05 21:36:18,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:36:18,496 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:36:18,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18 WrapperNode [2025-02-05 21:36:18,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:36:18,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:36:18,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:36:18,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:36:18,506 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:36:18" (1/1) ... [2025-02-05 21:36:18,521 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:36:18" (1/1) ... [2025-02-05 21:36:18,587 INFO L138 Inliner]: procedures = 26, calls = 90, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 556 [2025-02-05 21:36:18,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:36:18,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:36:18,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:36:18,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:36:18,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,649 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:36:18,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:36:18,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:36:18,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:36:18,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:36:18,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (1/1) ... [2025-02-05 21:36:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:36:18,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:18,740 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:36:18,744 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:36:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:36:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:36:18,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:36:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:36:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:36:18,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:36:18,888 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:36:18,889 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:36:19,816 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 21:36:19,816 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:36:19,857 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:36:19,858 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:36:19,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:36:19 BoogieIcfgContainer [2025-02-05 21:36:19,858 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:36:19,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:36:19,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:36:19,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:36:19,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:36:18" (1/3) ... [2025-02-05 21:36:19,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a5b3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:36:19, skipping insertion in model container [2025-02-05 21:36:19,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:36:18" (2/3) ... [2025-02-05 21:36:19,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a5b3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:36:19, skipping insertion in model container [2025-02-05 21:36:19,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:36:19" (3/3) ... [2025-02-05 21:36:19,870 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-50.i [2025-02-05 21:36:19,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:36:19,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-50.i that has 2 procedures, 234 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:36:19,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:36:19,981 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;@678697d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:36:19,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:36:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 155 states have internal predecessors, (234), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 21:36:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:20,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:20,022 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:20,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash 917071166, now seen corresponding path program 1 times [2025-02-05 21:36:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:20,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530232759] [2025-02-05 21:36:20,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:20,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:20,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:20,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:20,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-02-05 21:36:20,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:20,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530232759] [2025-02-05 21:36:20,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530232759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667570083] [2025-02-05 21:36:20,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:20,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:20,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:20,718 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:36:20,720 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:36:20,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:21,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:21,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:21,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:21,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:36:21,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-02-05 21:36:21,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:36:21,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667570083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:21,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:36:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:36:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372300508] [2025-02-05 21:36:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:21,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:36:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:21,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:36:21,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:36:21,244 INFO L87 Difference]: Start difference. First operand has 234 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 155 states have internal predecessors, (234), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:36:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:21,334 INFO L93 Difference]: Finished difference Result 462 states and 848 transitions. [2025-02-05 21:36:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:36:21,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) Word has length 483 [2025-02-05 21:36:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:21,345 INFO L225 Difference]: With dead ends: 462 [2025-02-05 21:36:21,346 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 21:36:21,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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:36:21,354 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:21,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:36:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 21:36:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-05 21:36:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 152 states have (on average 1.5) internal successors, (228), 152 states have internal predecessors, (228), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 21:36:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 382 transitions. [2025-02-05 21:36:21,421 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 382 transitions. Word has length 483 [2025-02-05 21:36:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:21,423 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 382 transitions. [2025-02-05 21:36:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-02-05 21:36:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 382 transitions. [2025-02-05 21:36:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:21,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:21,437 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:21,447 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:36:21,642 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:36:21,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:21,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash -959637983, now seen corresponding path program 1 times [2025-02-05 21:36:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744838586] [2025-02-05 21:36:21,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:21,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:21,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:22,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:22,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744838586] [2025-02-05 21:36:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744838586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:22,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:22,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:36:22,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921851971] [2025-02-05 21:36:22,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:22,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:36:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:22,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:36:22,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:22,169 INFO L87 Difference]: Start difference. First operand 231 states and 382 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:22,295 INFO L93 Difference]: Finished difference Result 592 states and 983 transitions. [2025-02-05 21:36:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:36:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:22,304 INFO L225 Difference]: With dead ends: 592 [2025-02-05 21:36:22,304 INFO L226 Difference]: Without dead ends: 364 [2025-02-05 21:36:22,306 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:36:22,306 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 227 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:22,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 776 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:36:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-05 21:36:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2025-02-05 21:36:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 259 states have (on average 1.5444015444015444) internal successors, (400), 260 states have internal predecessors, (400), 99 states have call successors, (99), 2 states have call predecessors, (99), 2 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:36:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 598 transitions. [2025-02-05 21:36:22,377 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 598 transitions. Word has length 483 [2025-02-05 21:36:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:22,378 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 598 transitions. [2025-02-05 21:36:22,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 598 transitions. [2025-02-05 21:36:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:22,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:22,392 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:22,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:36:22,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:22,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1927410552, now seen corresponding path program 1 times [2025-02-05 21:36:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:22,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421319785] [2025-02-05 21:36:22,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:22,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:22,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:22,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:22,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421319785] [2025-02-05 21:36:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421319785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:36:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159269582] [2025-02-05 21:36:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:36:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:22,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:36:22,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:22,755 INFO L87 Difference]: Start difference. First operand 361 states and 598 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:22,877 INFO L93 Difference]: Finished difference Result 966 states and 1594 transitions. [2025-02-05 21:36:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:36:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:22,891 INFO L225 Difference]: With dead ends: 966 [2025-02-05 21:36:22,891 INFO L226 Difference]: Without dead ends: 608 [2025-02-05 21:36:22,892 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:36:22,893 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 227 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:22,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 728 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:36:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-05 21:36:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2025-02-05 21:36:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 424 states have (on average 1.5070754716981132) internal successors, (639), 427 states have internal predecessors, (639), 176 states have call successors, (176), 4 states have call predecessors, (176), 4 states have return successors, (176), 173 states have call predecessors, (176), 176 states have call successors, (176) [2025-02-05 21:36:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 991 transitions. [2025-02-05 21:36:22,988 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 991 transitions. Word has length 483 [2025-02-05 21:36:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 991 transitions. [2025-02-05 21:36:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 991 transitions. [2025-02-05 21:36:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:23,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:23,003 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:23,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:36:23,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:23,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash -642075847, now seen corresponding path program 1 times [2025-02-05 21:36:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929338950] [2025-02-05 21:36:23,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:23,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:23,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:23,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:23,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:23,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929338950] [2025-02-05 21:36:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929338950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:23,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:23,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:36:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611528037] [2025-02-05 21:36:23,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:36:23,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:23,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:36:23,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:23,398 INFO L87 Difference]: Start difference. First operand 605 states and 991 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:23,496 INFO L93 Difference]: Finished difference Result 1214 states and 1984 transitions. [2025-02-05 21:36:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:36:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:23,503 INFO L225 Difference]: With dead ends: 1214 [2025-02-05 21:36:23,503 INFO L226 Difference]: Without dead ends: 612 [2025-02-05 21:36:23,505 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:36:23,506 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 224 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:23,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 922 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:36:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-05 21:36:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 435. [2025-02-05 21:36:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 332 states have (on average 1.5572289156626506) internal successors, (517), 333 states have internal predecessors, (517), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:36:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 715 transitions. [2025-02-05 21:36:23,556 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 715 transitions. Word has length 483 [2025-02-05 21:36:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:23,558 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 715 transitions. [2025-02-05 21:36:23,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 715 transitions. [2025-02-05 21:36:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:23,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:23,568 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:23,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:36:23,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:23,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1152610024, now seen corresponding path program 1 times [2025-02-05 21:36:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941055125] [2025-02-05 21:36:23,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:23,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:23,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:23,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:23,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941055125] [2025-02-05 21:36:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941055125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:24,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:24,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:36:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067260332] [2025-02-05 21:36:24,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:24,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:36:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:24,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:36:24,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:24,048 INFO L87 Difference]: Start difference. First operand 435 states and 715 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:24,498 INFO L93 Difference]: Finished difference Result 1297 states and 2135 transitions. [2025-02-05 21:36:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:36:24,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:36:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:24,507 INFO L225 Difference]: With dead ends: 1297 [2025-02-05 21:36:24,507 INFO L226 Difference]: Without dead ends: 865 [2025-02-05 21:36:24,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:36:24,511 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 375 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:24,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 934 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-02-05 21:36:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 443. [2025-02-05 21:36:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 340 states have (on average 1.55) internal successors, (527), 341 states have internal predecessors, (527), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:36:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 725 transitions. [2025-02-05 21:36:24,583 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 725 transitions. Word has length 483 [2025-02-05 21:36:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:24,584 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 725 transitions. [2025-02-05 21:36:24,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 725 transitions. [2025-02-05 21:36:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:24,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:24,593 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:36:24,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:24,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -265106343, now seen corresponding path program 1 times [2025-02-05 21:36:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849911162] [2025-02-05 21:36:24,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:24,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:24,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:24,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:24,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:25,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849911162] [2025-02-05 21:36:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849911162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:25,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:36:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079191771] [2025-02-05 21:36:25,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:25,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:36:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:25,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:36:25,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:25,234 INFO L87 Difference]: Start difference. First operand 443 states and 725 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:25,286 INFO L93 Difference]: Finished difference Result 887 states and 1455 transitions. [2025-02-05 21:36:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:36:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:25,291 INFO L225 Difference]: With dead ends: 887 [2025-02-05 21:36:25,291 INFO L226 Difference]: Without dead ends: 447 [2025-02-05 21:36:25,292 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:36:25,293 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:25,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 735 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:36:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-02-05 21:36:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-02-05 21:36:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 344 states have (on average 1.5436046511627908) internal successors, (531), 345 states have internal predecessors, (531), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:36:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 729 transitions. [2025-02-05 21:36:25,328 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 729 transitions. Word has length 483 [2025-02-05 21:36:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:25,329 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 729 transitions. [2025-02-05 21:36:25,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 729 transitions. [2025-02-05 21:36:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:25,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:25,337 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:25,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:36:25,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:25,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash -234086536, now seen corresponding path program 1 times [2025-02-05 21:36:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:25,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380365596] [2025-02-05 21:36:25,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:25,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:25,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:25,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:25,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:26,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:26,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380365596] [2025-02-05 21:36:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380365596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:26,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:26,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:36:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866438520] [2025-02-05 21:36:26,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:26,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:36:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:26,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:36:26,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:26,234 INFO L87 Difference]: Start difference. First operand 447 states and 729 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:26,767 INFO L93 Difference]: Finished difference Result 1663 states and 2703 transitions. [2025-02-05 21:36:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:36:26,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:36:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:26,775 INFO L225 Difference]: With dead ends: 1663 [2025-02-05 21:36:26,775 INFO L226 Difference]: Without dead ends: 1219 [2025-02-05 21:36:26,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:36:26,778 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 596 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:26,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1203 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-02-05 21:36:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 947. [2025-02-05 21:36:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 802 states have (on average 1.6134663341645885) internal successors, (1294), 805 states have internal predecessors, (1294), 139 states have call successors, (139), 5 states have call predecessors, (139), 5 states have return successors, (139), 136 states have call predecessors, (139), 139 states have call successors, (139) [2025-02-05 21:36:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1572 transitions. [2025-02-05 21:36:26,837 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1572 transitions. Word has length 483 [2025-02-05 21:36:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:26,838 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1572 transitions. [2025-02-05 21:36:26,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1572 transitions. [2025-02-05 21:36:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:26,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:26,845 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:26,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:36:26,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1231158889, now seen corresponding path program 1 times [2025-02-05 21:36:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54265519] [2025-02-05 21:36:26,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:26,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:27,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:27,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:27,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54265519] [2025-02-05 21:36:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54265519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:28,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:36:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585020709] [2025-02-05 21:36:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:28,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:36:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:28,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:36:28,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:36:28,129 INFO L87 Difference]: Start difference. First operand 947 states and 1572 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:29,154 INFO L93 Difference]: Finished difference Result 4132 states and 6857 transitions. [2025-02-05 21:36:29,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:36:29,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-02-05 21:36:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:29,178 INFO L225 Difference]: With dead ends: 4132 [2025-02-05 21:36:29,179 INFO L226 Difference]: Without dead ends: 3188 [2025-02-05 21:36:29,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:36:29,185 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 749 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:29,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1286 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:36:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2025-02-05 21:36:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 2111. [2025-02-05 21:36:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1864 states have (on average 1.613733905579399) internal successors, (3008), 1871 states have internal predecessors, (3008), 237 states have call successors, (237), 9 states have call predecessors, (237), 9 states have return successors, (237), 230 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-05 21:36:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3482 transitions. [2025-02-05 21:36:29,336 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3482 transitions. Word has length 483 [2025-02-05 21:36:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:29,338 INFO L471 AbstractCegarLoop]: Abstraction has 2111 states and 3482 transitions. [2025-02-05 21:36:29,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3482 transitions. [2025-02-05 21:36:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-05 21:36:29,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:29,345 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:36:29,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:29,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:29,346 INFO L85 PathProgramCache]: Analyzing trace with hash 986599064, now seen corresponding path program 1 times [2025-02-05 21:36:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:29,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110447151] [2025-02-05 21:36:29,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:29,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:29,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:29,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:29,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:29,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 165 proven. 63 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:36:29,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110447151] [2025-02-05 21:36:29,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110447151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:29,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394840651] [2025-02-05 21:36:29,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:29,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:29,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:29,992 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:36:29,994 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:36:30,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-05 21:36:30,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-05 21:36:30,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:30,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:30,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:36:30,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4806 proven. 63 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-02-05 21:36:30,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:36:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 165 proven. 63 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:36:31,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394840651] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:36:31,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:36:31,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:36:31,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93894720] [2025-02-05 21:36:31,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:36:31,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:36:31,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:31,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:36:31,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:36:31,108 INFO L87 Difference]: Start difference. First operand 2111 states and 3482 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (98), 2 states have call predecessors, (98), 4 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:36:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:31,697 INFO L93 Difference]: Finished difference Result 3715 states and 6106 transitions. [2025-02-05 21:36:31,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:36:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (98), 2 states have call predecessors, (98), 4 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 483 [2025-02-05 21:36:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:31,709 INFO L225 Difference]: With dead ends: 3715 [2025-02-05 21:36:31,710 INFO L226 Difference]: Without dead ends: 1607 [2025-02-05 21:36:31,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 963 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:36:31,715 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 444 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:31,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 695 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-02-05 21:36:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1589. [2025-02-05 21:36:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1341 states have (on average 1.5786726323639075) internal successors, (2117), 1348 states have internal predecessors, (2117), 237 states have call successors, (237), 10 states have call predecessors, (237), 10 states have return successors, (237), 230 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-05 21:36:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2591 transitions. [2025-02-05 21:36:31,814 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2591 transitions. Word has length 483 [2025-02-05 21:36:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2591 transitions. [2025-02-05 21:36:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (98), 2 states have call predecessors, (98), 4 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:36:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2591 transitions. [2025-02-05 21:36:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 21:36:31,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:31,821 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:31,831 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:36:32,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:32,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash -168620681, now seen corresponding path program 1 times [2025-02-05 21:36:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:32,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634657260] [2025-02-05 21:36:32,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:32,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:36:32,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:36:32,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:32,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 105 proven. 345 refuted. 0 times theorem prover too weak. 11254 trivial. 0 not checked. [2025-02-05 21:36:33,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:33,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634657260] [2025-02-05 21:36:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634657260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:33,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872830962] [2025-02-05 21:36:33,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:33,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:33,546 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:36:33,550 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:36:33,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:36:33,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:36:33,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:33,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:33,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 21:36:33,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4413 proven. 345 refuted. 0 times theorem prover too weak. 6946 trivial. 0 not checked. [2025-02-05 21:36:35,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:36:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 105 proven. 348 refuted. 0 times theorem prover too weak. 11251 trivial. 0 not checked. [2025-02-05 21:36:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872830962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:36:37,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:36:37,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 23 [2025-02-05 21:36:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228577188] [2025-02-05 21:36:37,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:36:37,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 21:36:37,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:37,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 21:36:37,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:36:37,181 INFO L87 Difference]: Start difference. First operand 1589 states and 2591 transitions. Second operand has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 6 states have call successors, (195), 3 states have call predecessors, (195), 7 states have return successors, (196), 6 states have call predecessors, (196), 6 states have call successors, (196) [2025-02-05 21:36:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:40,057 INFO L93 Difference]: Finished difference Result 5031 states and 8009 transitions. [2025-02-05 21:36:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 21:36:40,058 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 6 states have call successors, (195), 3 states have call predecessors, (195), 7 states have return successors, (196), 6 states have call predecessors, (196), 6 states have call successors, (196) Word has length 484 [2025-02-05 21:36:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:40,080 INFO L225 Difference]: With dead ends: 5031 [2025-02-05 21:36:40,080 INFO L226 Difference]: Without dead ends: 3445 [2025-02-05 21:36:40,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 21:36:40,087 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1237 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 2477 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:40,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 3697 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2477 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 21:36:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2025-02-05 21:36:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 1933. [2025-02-05 21:36:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1542 states have (on average 1.5188067444876783) internal successors, (2342), 1553 states have internal predecessors, (2342), 356 states have call successors, (356), 34 states have call predecessors, (356), 34 states have return successors, (356), 345 states have call predecessors, (356), 356 states have call successors, (356) [2025-02-05 21:36:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 3054 transitions. [2025-02-05 21:36:40,289 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 3054 transitions. Word has length 484 [2025-02-05 21:36:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:40,290 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 3054 transitions. [2025-02-05 21:36:40,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 6 states have call successors, (195), 3 states have call predecessors, (195), 7 states have return successors, (196), 6 states have call predecessors, (196), 6 states have call successors, (196) [2025-02-05 21:36:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 3054 transitions. [2025-02-05 21:36:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 21:36:40,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:40,296 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:36:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:40,497 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:40,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1441891575, now seen corresponding path program 1 times [2025-02-05 21:36:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722445669] [2025-02-05 21:36:40,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:40,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:36:40,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:36:40,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:40,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:40,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722445669] [2025-02-05 21:36:40,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722445669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:40,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:36:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684998557] [2025-02-05 21:36:40,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:40,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:36:40,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:40,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:36:40,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:40,742 INFO L87 Difference]: Start difference. First operand 1933 states and 3054 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:41,154 INFO L93 Difference]: Finished difference Result 3863 states and 6105 transitions. [2025-02-05 21:36:41,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:36:41,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 484 [2025-02-05 21:36:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:41,166 INFO L225 Difference]: With dead ends: 3863 [2025-02-05 21:36:41,166 INFO L226 Difference]: Without dead ends: 1933 [2025-02-05 21:36:41,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:36:41,171 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 371 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:41,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 565 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:36:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-02-05 21:36:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1901. [2025-02-05 21:36:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1510 states have (on average 1.5165562913907285) internal successors, (2290), 1521 states have internal predecessors, (2290), 356 states have call successors, (356), 34 states have call predecessors, (356), 34 states have return successors, (356), 345 states have call predecessors, (356), 356 states have call successors, (356) [2025-02-05 21:36:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 3002 transitions. [2025-02-05 21:36:41,320 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 3002 transitions. Word has length 484 [2025-02-05 21:36:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:41,321 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 3002 transitions. [2025-02-05 21:36:41,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 3002 transitions. [2025-02-05 21:36:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 21:36:41,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:41,326 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:36:41,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:41,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1965572040, now seen corresponding path program 1 times [2025-02-05 21:36:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151995229] [2025-02-05 21:36:41,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:41,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:36:41,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:36:41,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:41,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:36:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556238053] [2025-02-05 21:36:41,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:41,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:41,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:41,628 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:36:41,631 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:36:41,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:36:41,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:36:41,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:41,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:41,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 21:36:42,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4738 proven. 165 refuted. 0 times theorem prover too weak. 6801 trivial. 0 not checked. [2025-02-05 21:36:42,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:36:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:43,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151995229] [2025-02-05 21:36:43,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:36:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556238053] [2025-02-05 21:36:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556238053] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:43,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:36:43,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-02-05 21:36:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238217056] [2025-02-05 21:36:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:43,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:36:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:43,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:36:43,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:36:43,334 INFO L87 Difference]: Start difference. First operand 1901 states and 3002 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:44,130 INFO L93 Difference]: Finished difference Result 5444 states and 8405 transitions. [2025-02-05 21:36:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:36:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 484 [2025-02-05 21:36:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:44,154 INFO L225 Difference]: With dead ends: 5444 [2025-02-05 21:36:44,154 INFO L226 Difference]: Without dead ends: 3546 [2025-02-05 21:36:44,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:36:44,161 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 464 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:44,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1715 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2025-02-05 21:36:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3256. [2025-02-05 21:36:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3256 states, 2459 states have (on average 1.4566897112647417) internal successors, (3582), 2486 states have internal predecessors, (3582), 714 states have call successors, (714), 82 states have call predecessors, (714), 82 states have return successors, (714), 687 states have call predecessors, (714), 714 states have call successors, (714) [2025-02-05 21:36:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 5010 transitions. [2025-02-05 21:36:44,490 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 5010 transitions. Word has length 484 [2025-02-05 21:36:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 3256 states and 5010 transitions. [2025-02-05 21:36:44,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 5010 transitions. [2025-02-05 21:36:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-05 21:36:44,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:44,498 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 21:36:44,699 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,SelfDestructingSolverStorable11 [2025-02-05 21:36:44,699 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash -976259046, now seen corresponding path program 1 times [2025-02-05 21:36:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5060599] [2025-02-05 21:36:44,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:44,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-05 21:36:44,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-05 21:36:44,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:44,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:45,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5060599] [2025-02-05 21:36:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5060599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:45,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:45,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:36:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966048273] [2025-02-05 21:36:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:45,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:36:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:45,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:36:45,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:45,018 INFO L87 Difference]: Start difference. First operand 3256 states and 5010 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:45,466 INFO L93 Difference]: Finished difference Result 8054 states and 12401 transitions. [2025-02-05 21:36:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 484 [2025-02-05 21:36:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:45,494 INFO L225 Difference]: With dead ends: 8054 [2025-02-05 21:36:45,494 INFO L226 Difference]: Without dead ends: 4801 [2025-02-05 21:36:45,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:36:45,505 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 248 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:45,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1221 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:36:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states. [2025-02-05 21:36:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 4733. [2025-02-05 21:36:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4733 states, 3581 states have (on average 1.4582518849483384) internal successors, (5222), 3619 states have internal predecessors, (5222), 1033 states have call successors, (1033), 118 states have call predecessors, (1033), 118 states have return successors, (1033), 995 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-02-05 21:36:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 7288 transitions. [2025-02-05 21:36:45,970 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 7288 transitions. Word has length 484 [2025-02-05 21:36:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:45,971 INFO L471 AbstractCegarLoop]: Abstraction has 4733 states and 7288 transitions. [2025-02-05 21:36:45,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 7288 transitions. [2025-02-05 21:36:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:36:45,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:45,978 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:36:45,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:45,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1020272580, now seen corresponding path program 1 times [2025-02-05 21:36:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:45,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4458916] [2025-02-05 21:36:45,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:46,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:36:46,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:36:46,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:46,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:36:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4458916] [2025-02-05 21:36:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4458916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:36:46,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:36:46,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:36:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202986532] [2025-02-05 21:36:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:36:46,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:36:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:46,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:36:46,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:36:46,200 INFO L87 Difference]: Start difference. First operand 4733 states and 7288 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:46,703 INFO L93 Difference]: Finished difference Result 9475 states and 14597 transitions. [2025-02-05 21:36:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:36:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 486 [2025-02-05 21:36:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:46,734 INFO L225 Difference]: With dead ends: 9475 [2025-02-05 21:36:46,734 INFO L226 Difference]: Without dead ends: 4745 [2025-02-05 21:36:46,748 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:36:46,749 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:46,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 726 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:36:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4745 states. [2025-02-05 21:36:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4745 to 4745. [2025-02-05 21:36:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4745 states, 3593 states have (on average 1.4567214027275257) internal successors, (5234), 3631 states have internal predecessors, (5234), 1033 states have call successors, (1033), 118 states have call predecessors, (1033), 118 states have return successors, (1033), 995 states have call predecessors, (1033), 1033 states have call successors, (1033) [2025-02-05 21:36:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 7300 transitions. [2025-02-05 21:36:47,319 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 7300 transitions. Word has length 486 [2025-02-05 21:36:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:47,320 INFO L471 AbstractCegarLoop]: Abstraction has 4745 states and 7300 transitions. [2025-02-05 21:36:47,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:36:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 7300 transitions. [2025-02-05 21:36:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:36:47,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:47,373 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:47,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:36:47,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:47,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -896199333, now seen corresponding path program 1 times [2025-02-05 21:36:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:47,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406255058] [2025-02-05 21:36:47,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:47,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:36:47,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:36:47,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:47,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 219 proven. 9 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:36:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406255058] [2025-02-05 21:36:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406255058] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:47,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068157583] [2025-02-05 21:36:47,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:47,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:47,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:47,845 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:36:47,848 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:36:48,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:36:48,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:36:48,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:48,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:48,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:36:48,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 1098 proven. 9 refuted. 0 times theorem prover too weak. 10597 trivial. 0 not checked. [2025-02-05 21:36:48,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:36:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 219 proven. 9 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-02-05 21:36:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068157583] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:36:48,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:36:48,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 21:36:48,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561480439] [2025-02-05 21:36:48,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:36:48,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:36:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:48,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:36:48,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:36:48,620 INFO L87 Difference]: Start difference. First operand 4745 states and 7300 transitions. Second operand has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 4 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2025-02-05 21:36:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:49,515 INFO L93 Difference]: Finished difference Result 9137 states and 13909 transitions. [2025-02-05 21:36:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:36:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 4 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) Word has length 486 [2025-02-05 21:36:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:49,546 INFO L225 Difference]: With dead ends: 9137 [2025-02-05 21:36:49,547 INFO L226 Difference]: Without dead ends: 4395 [2025-02-05 21:36:49,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 969 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:36:49,561 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 436 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:49,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 696 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:36:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2025-02-05 21:36:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 2194. [2025-02-05 21:36:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 1725 states have (on average 1.48231884057971) internal successors, (2557), 1735 states have internal predecessors, (2557), 412 states have call successors, (412), 56 states have call predecessors, (412), 56 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-02-05 21:36:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 3381 transitions. [2025-02-05 21:36:49,923 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 3381 transitions. Word has length 486 [2025-02-05 21:36:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 2194 states and 3381 transitions. [2025-02-05 21:36:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.77777777777778) internal successors, (187), 9 states have internal predecessors, (187), 4 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2025-02-05 21:36:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 3381 transitions. [2025-02-05 21:36:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 21:36:49,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:49,929 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 21:36:50,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 21:36:50,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:50,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1893271686, now seen corresponding path program 1 times [2025-02-05 21:36:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185487879] [2025-02-05 21:36:50,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:50,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:36:50,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:36:50,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:50,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 489 proven. 591 refuted. 0 times theorem prover too weak. 10624 trivial. 0 not checked. [2025-02-05 21:36:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:36:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185487879] [2025-02-05 21:36:51,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185487879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:36:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979964640] [2025-02-05 21:36:51,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:51,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:36:51,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:36:51,905 INFO L229 MonitoredProcess]: Starting monitored process 7 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:36:51,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:36:52,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 21:36:52,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 21:36:52,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:36:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:36:52,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 21:36:52,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:36:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 6418 proven. 591 refuted. 0 times theorem prover too weak. 4695 trivial. 0 not checked. [2025-02-05 21:36:54,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:36:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 402 proven. 492 refuted. 0 times theorem prover too weak. 10810 trivial. 0 not checked. [2025-02-05 21:36:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979964640] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:36:56,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:36:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 16] total 39 [2025-02-05 21:36:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908744737] [2025-02-05 21:36:56,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:36:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-05 21:36:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:36:56,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-05 21:36:56,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 21:36:56,393 INFO L87 Difference]: Start difference. First operand 2194 states and 3381 transitions. Second operand has 39 states, 37 states have (on average 5.621621621621622) internal successors, (208), 35 states have internal predecessors, (208), 14 states have call successors, (165), 6 states have call predecessors, (165), 12 states have return successors, (166), 14 states have call predecessors, (166), 14 states have call successors, (166) [2025-02-05 21:37:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:05,529 INFO L93 Difference]: Finished difference Result 11863 states and 17729 transitions. [2025-02-05 21:37:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-02-05 21:37:05,530 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 5.621621621621622) internal successors, (208), 35 states have internal predecessors, (208), 14 states have call successors, (165), 6 states have call predecessors, (165), 12 states have return successors, (166), 14 states have call predecessors, (166), 14 states have call successors, (166) Word has length 486 [2025-02-05 21:37:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:05,565 INFO L225 Difference]: With dead ends: 11863 [2025-02-05 21:37:05,566 INFO L226 Difference]: Without dead ends: 9672 [2025-02-05 21:37:05,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 975 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10786 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5344, Invalid=22712, Unknown=0, NotChecked=0, Total=28056 [2025-02-05 21:37:05,580 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 7550 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 2448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7582 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 5854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2448 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:05,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7582 Valid, 2583 Invalid, 5854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2448 Valid, 3406 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 21:37:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2025-02-05 21:37:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 6512. [2025-02-05 21:37:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 5281 states have (on average 1.4881651202423782) internal successors, (7859), 5305 states have internal predecessors, (7859), 1055 states have call successors, (1055), 175 states have call predecessors, (1055), 175 states have return successors, (1055), 1031 states have call predecessors, (1055), 1055 states have call successors, (1055) [2025-02-05 21:37:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 9969 transitions. [2025-02-05 21:37:06,475 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 9969 transitions. Word has length 486 [2025-02-05 21:37:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:06,476 INFO L471 AbstractCegarLoop]: Abstraction has 6512 states and 9969 transitions. [2025-02-05 21:37:06,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 5.621621621621622) internal successors, (208), 35 states have internal predecessors, (208), 14 states have call successors, (165), 6 states have call predecessors, (165), 12 states have return successors, (166), 14 states have call predecessors, (166), 14 states have call successors, (166) [2025-02-05 21:37:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 9969 transitions. [2025-02-05 21:37:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-02-05 21:37:06,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:06,484 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:06,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 21:37:06,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 21:37:06,685 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:06,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1093145681, now seen corresponding path program 1 times [2025-02-05 21:37:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201336547] [2025-02-05 21:37:06,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:06,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-05 21:37:06,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-05 21:37:06,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:06,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-02-05 21:37:07,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:07,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201336547] [2025-02-05 21:37:07,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201336547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:07,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:37:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351958121] [2025-02-05 21:37:07,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:07,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:37:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:07,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:37:07,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:07,625 INFO L87 Difference]: Start difference. First operand 6512 states and 9969 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:37:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:10,134 INFO L93 Difference]: Finished difference Result 24523 states and 36894 transitions. [2025-02-05 21:37:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 487 [2025-02-05 21:37:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:10,203 INFO L225 Difference]: With dead ends: 24523 [2025-02-05 21:37:10,203 INFO L226 Difference]: Without dead ends: 18014 [2025-02-05 21:37:10,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:10,221 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 594 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:10,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1404 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:37:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18014 states. [2025-02-05 21:37:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18014 to 7608. [2025-02-05 21:37:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7608 states, 6377 states have (on average 1.5242276932726988) internal successors, (9720), 6401 states have internal predecessors, (9720), 1055 states have call successors, (1055), 175 states have call predecessors, (1055), 175 states have return successors, (1055), 1031 states have call predecessors, (1055), 1055 states have call successors, (1055) [2025-02-05 21:37:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7608 states to 7608 states and 11830 transitions. [2025-02-05 21:37:11,450 INFO L78 Accepts]: Start accepts. Automaton has 7608 states and 11830 transitions. Word has length 487 [2025-02-05 21:37:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:11,451 INFO L471 AbstractCegarLoop]: Abstraction has 7608 states and 11830 transitions. [2025-02-05 21:37:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-02-05 21:37:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7608 states and 11830 transitions. [2025-02-05 21:37:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-02-05 21:37:11,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:11,459 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 21:37:11,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:11,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1124165488, now seen corresponding path program 1 times [2025-02-05 21:37:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382794455] [2025-02-05 21:37:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:11,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-05 21:37:11,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-05 21:37:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 489 proven. 591 refuted. 0 times theorem prover too weak. 10624 trivial. 0 not checked. [2025-02-05 21:37:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382794455] [2025-02-05 21:37:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382794455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954319143] [2025-02-05 21:37:12,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:12,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:12,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:12,859 INFO L229 MonitoredProcess]: Starting monitored process 8 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:37:12,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 21:37:13,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-05 21:37:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-05 21:37:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:13,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 21:37:13,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 6534 proven. 474 refuted. 0 times theorem prover too weak. 4696 trivial. 0 not checked. [2025-02-05 21:37:15,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:37:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 402 proven. 492 refuted. 0 times theorem prover too weak. 10810 trivial. 0 not checked. [2025-02-05 21:37:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954319143] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:37:16,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:37:16,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 39 [2025-02-05 21:37:16,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115964011] [2025-02-05 21:37:16,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:37:16,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-05 21:37:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:16,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-05 21:37:16,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 21:37:16,787 INFO L87 Difference]: Start difference. First operand 7608 states and 11830 transitions. Second operand has 39 states, 37 states have (on average 5.945945945945946) internal successors, (220), 36 states have internal predecessors, (220), 14 states have call successors, (165), 5 states have call predecessors, (165), 12 states have return successors, (166), 14 states have call predecessors, (166), 14 states have call successors, (166)