./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-83.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-83.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 0b7d7572b4223b408ecca691daf97dc79641f0b4c97b6315410d3e8868a73776 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:40:28,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:40:28,535 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:40:28,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:40:28,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:40:28,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:40:28,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:40:28,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:40:28,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:40:28,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:40:28,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:40:28,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:40:28,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:40:28,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:40:28,572 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:40:28,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:40:28,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:40:28,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:40:28,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:40:28,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:40:28,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:40:28,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:40:28,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:40:28,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:40:28,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:40:28,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:40:28,574 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 -> 0b7d7572b4223b408ecca691daf97dc79641f0b4c97b6315410d3e8868a73776 [2025-02-05 21:40:28,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:40:28,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:40:28,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:40:28,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:40:28,819 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:40:28,820 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-83.i [2025-02-05 21:40:30,003 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07da65308/452bdb13559d4dc0b29ec301a76f720b/FLAG0e5132c8a [2025-02-05 21:40:30,310 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:40:30,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-83.i [2025-02-05 21:40:30,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07da65308/452bdb13559d4dc0b29ec301a76f720b/FLAG0e5132c8a [2025-02-05 21:40:30,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07da65308/452bdb13559d4dc0b29ec301a76f720b [2025-02-05 21:40:30,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:40:30,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:40:30,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:40:30,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:40:30,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:40:30,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:30,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c8be21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30, skipping insertion in model container [2025-02-05 21:40:30,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:30,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:40:30,724 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-83.i[916,929] [2025-02-05 21:40:30,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:40:30,836 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:40:30,847 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-83.i[916,929] [2025-02-05 21:40:30,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:40:30,919 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:40:30,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30 WrapperNode [2025-02-05 21:40:30,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:40:30,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:40:30,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:40:30,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:40:30,925 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:40:30" (1/1) ... [2025-02-05 21:40:30,944 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:40:30" (1/1) ... [2025-02-05 21:40:31,012 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 695 [2025-02-05 21:40:31,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:40:31,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:40:31,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:40:31,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:40:31,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,077 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:40:31,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:40:31,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:40:31,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:40:31,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:40:31,152 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (1/1) ... [2025-02-05 21:40:31,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:40:31,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:31,186 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:40:31,194 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:40:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:40:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:40:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:40:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:40:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:40:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:40:31,305 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:40:31,307 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:40:31,932 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc property_#t~ite75#1;havoc property_#t~bitwise73#1;havoc property_#t~bitwise74#1;havoc property_#t~short76#1; [2025-02-05 21:40:32,044 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-05 21:40:32,045 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:40:32,084 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:40:32,084 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:40:32,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:40:32 BoogieIcfgContainer [2025-02-05 21:40:32,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:40:32,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:40:32,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:40:32,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:40:32,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:40:30" (1/3) ... [2025-02-05 21:40:32,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4130b520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:40:32, skipping insertion in model container [2025-02-05 21:40:32,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:30" (2/3) ... [2025-02-05 21:40:32,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4130b520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:40:32, skipping insertion in model container [2025-02-05 21:40:32,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:40:32" (3/3) ... [2025-02-05 21:40:32,095 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-83.i [2025-02-05 21:40:32,107 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:40:32,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-83.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:40:32,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:40:32,176 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;@3da846fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:40:32,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:40:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 192 states have (on average 1.53125) internal successors, (294), 193 states have internal predecessors, (294), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 21:40:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-02-05 21:40:32,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:32,208 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:32,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:32,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:32,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1125803079, now seen corresponding path program 1 times [2025-02-05 21:40:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594300587] [2025-02-05 21:40:32,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:32,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-05 21:40:32,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-05 21:40:32,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:32,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-02-05 21:40:32,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594300587] [2025-02-05 21:40:32,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594300587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514576240] [2025-02-05 21:40:32,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:32,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:32,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:32,753 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:40:32,755 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:40:32,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-05 21:40:33,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-05 21:40:33,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:33,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:33,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:40:33,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-02-05 21:40:33,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:40:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514576240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:40:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:40:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135261751] [2025-02-05 21:40:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:33,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:40:33,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:33,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:40:33,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:40:33,151 INFO L87 Difference]: Start difference. First operand has 284 states, 192 states have (on average 1.53125) internal successors, (294), 193 states have internal predecessors, (294), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-02-05 21:40:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:33,226 INFO L93 Difference]: Finished difference Result 562 states and 1028 transitions. [2025-02-05 21:40:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:40:33,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 557 [2025-02-05 21:40:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:33,240 INFO L225 Difference]: With dead ends: 562 [2025-02-05 21:40:33,240 INFO L226 Difference]: Without dead ends: 281 [2025-02-05 21:40:33,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 558 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:40:33,251 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:33,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:40:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-05 21:40:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-02-05 21:40:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 190 states have (on average 1.5210526315789474) internal successors, (289), 190 states have internal predecessors, (289), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-05 21:40:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 467 transitions. [2025-02-05 21:40:33,327 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 467 transitions. Word has length 557 [2025-02-05 21:40:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:33,328 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 467 transitions. [2025-02-05 21:40:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-02-05 21:40:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 467 transitions. [2025-02-05 21:40:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-02-05 21:40:33,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:33,343 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:33,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:40:33,548 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:40:33,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:33,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash 660662548, now seen corresponding path program 1 times [2025-02-05 21:40:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753145275] [2025-02-05 21:40:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-05 21:40:33,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-05 21:40:33,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:33,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-05 21:40:34,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:34,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753145275] [2025-02-05 21:40:34,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753145275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:34,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:34,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:40:34,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573028764] [2025-02-05 21:40:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:34,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:40:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:34,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:40:34,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:40:34,087 INFO L87 Difference]: Start difference. First operand 281 states and 467 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:40:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:34,209 INFO L93 Difference]: Finished difference Result 732 states and 1218 transitions. [2025-02-05 21:40:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:40:34,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 557 [2025-02-05 21:40:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:34,218 INFO L225 Difference]: With dead ends: 732 [2025-02-05 21:40:34,218 INFO L226 Difference]: Without dead ends: 454 [2025-02-05 21:40:34,219 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:40:34,222 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 266 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:34,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 879 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:40:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-05 21:40:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2025-02-05 21:40:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 315 states have (on average 1.5365079365079366) internal successors, (484), 316 states have internal predecessors, (484), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-02-05 21:40:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 750 transitions. [2025-02-05 21:40:34,288 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 750 transitions. Word has length 557 [2025-02-05 21:40:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:34,291 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 750 transitions. [2025-02-05 21:40:34,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:40:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 750 transitions. [2025-02-05 21:40:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-02-05 21:40:34,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:34,300 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:34,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:40:34,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:34,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:34,301 INFO L85 PathProgramCache]: Analyzing trace with hash 903033268, now seen corresponding path program 1 times [2025-02-05 21:40:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57193972] [2025-02-05 21:40:34,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:34,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-05 21:40:34,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-05 21:40:34,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:34,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:40:35,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57193972] [2025-02-05 21:40:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57193972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119183244] [2025-02-05 21:40:35,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:35,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:35,326 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:40:35,328 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:40:35,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-05 21:40:35,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-05 21:40:35,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:35,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:35,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:40:35,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 7648 proven. 156 refuted. 0 times theorem prover too weak. 7860 trivial. 0 not checked. [2025-02-05 21:40:36,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 108 proven. 156 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:40:36,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119183244] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:36,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:36,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 21:40:36,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999380983] [2025-02-05 21:40:36,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:36,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:40:36,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:36,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:40:36,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:40:36,412 INFO L87 Difference]: Start difference. First operand 451 states and 750 transitions. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 4 states have call predecessors, (203), 4 states have call successors, (203) [2025-02-05 21:40:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:36,992 INFO L93 Difference]: Finished difference Result 919 states and 1513 transitions. [2025-02-05 21:40:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:40:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 4 states have call predecessors, (203), 4 states have call successors, (203) Word has length 557 [2025-02-05 21:40:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:36,998 INFO L225 Difference]: With dead ends: 919 [2025-02-05 21:40:36,998 INFO L226 Difference]: Without dead ends: 471 [2025-02-05 21:40:36,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:40:37,000 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 491 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:37,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 775 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:40:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-05 21:40:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 467. [2025-02-05 21:40:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 327 states have (on average 1.4984709480122325) internal successors, (490), 328 states have internal predecessors, (490), 133 states have call successors, (133), 6 states have call predecessors, (133), 6 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-02-05 21:40:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 756 transitions. [2025-02-05 21:40:37,031 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 756 transitions. Word has length 557 [2025-02-05 21:40:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 756 transitions. [2025-02-05 21:40:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (201), 2 states have call predecessors, (201), 4 states have return successors, (203), 4 states have call predecessors, (203), 4 states have call successors, (203) [2025-02-05 21:40:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 756 transitions. [2025-02-05 21:40:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-02-05 21:40:37,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:37,036 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:37,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 21:40:37,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:37,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:37,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:37,240 INFO L85 PathProgramCache]: Analyzing trace with hash 588210247, now seen corresponding path program 1 times [2025-02-05 21:40:37,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:37,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176595684] [2025-02-05 21:40:37,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:37,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-02-05 21:40:37,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-02-05 21:40:37,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:37,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-05 21:40:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:37,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176595684] [2025-02-05 21:40:37,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176595684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:37,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:37,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:40:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043335478] [2025-02-05 21:40:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:37,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:40:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:37,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:40:37,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:40:37,663 INFO L87 Difference]: Start difference. First operand 467 states and 756 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:40:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:38,240 INFO L93 Difference]: Finished difference Result 1739 states and 2818 transitions. [2025-02-05 21:40:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:40:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 559 [2025-02-05 21:40:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:38,251 INFO L225 Difference]: With dead ends: 1739 [2025-02-05 21:40:38,252 INFO L226 Difference]: Without dead ends: 1275 [2025-02-05 21:40:38,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:40:38,254 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 799 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:38,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1488 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:40:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2025-02-05 21:40:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 852. [2025-02-05 21:40:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 608 states have (on average 1.5148026315789473) internal successors, (921), 611 states have internal predecessors, (921), 231 states have call successors, (231), 12 states have call predecessors, (231), 12 states have return successors, (231), 228 states have call predecessors, (231), 231 states have call successors, (231) [2025-02-05 21:40:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1383 transitions. [2025-02-05 21:40:38,339 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1383 transitions. Word has length 559 [2025-02-05 21:40:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:38,340 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1383 transitions. [2025-02-05 21:40:38,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:40:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1383 transitions. [2025-02-05 21:40:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-02-05 21:40:38,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:38,344 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:38,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:40:38,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:38,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1662269147, now seen corresponding path program 1 times [2025-02-05 21:40:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:38,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606655848] [2025-02-05 21:40:38,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:38,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:38,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-02-05 21:40:38,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-02-05 21:40:38,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:38,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 144 proven. 120 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:40:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606655848] [2025-02-05 21:40:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606655848] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310415061] [2025-02-05 21:40:38,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:38,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:38,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:38,967 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:40:38,974 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:40:39,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-02-05 21:40:39,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-02-05 21:40:39,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:39,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:39,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 21:40:39,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 10688 proven. 189 refuted. 0 times theorem prover too weak. 4787 trivial. 0 not checked. [2025-02-05 21:40:40,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 333 proven. 192 refuted. 0 times theorem prover too weak. 15139 trivial. 0 not checked. [2025-02-05 21:40:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310415061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:40,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 21 [2025-02-05 21:40:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557979905] [2025-02-05 21:40:40,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:40,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 21:40:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:40,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 21:40:40,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:40:40,936 INFO L87 Difference]: Start difference. First operand 852 states and 1383 transitions. Second operand has 21 states, 20 states have (on average 13.5) internal successors, (270), 21 states have internal predecessors, (270), 10 states have call successors, (189), 5 states have call predecessors, (189), 9 states have return successors, (191), 10 states have call predecessors, (191), 10 states have call successors, (191) [2025-02-05 21:40:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:42,717 INFO L93 Difference]: Finished difference Result 2445 states and 3880 transitions. [2025-02-05 21:40:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 21:40:42,718 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 13.5) internal successors, (270), 21 states have internal predecessors, (270), 10 states have call successors, (189), 5 states have call predecessors, (189), 9 states have return successors, (191), 10 states have call predecessors, (191), 10 states have call successors, (191) Word has length 560 [2025-02-05 21:40:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:42,727 INFO L225 Difference]: With dead ends: 2445 [2025-02-05 21:40:42,727 INFO L226 Difference]: Without dead ends: 1596 [2025-02-05 21:40:42,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1110 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=837, Invalid=1815, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 21:40:42,730 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1626 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 731 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:42,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 1776 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:40:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-02-05 21:40:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1089. [2025-02-05 21:40:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 792 states have (on average 1.4911616161616161) internal successors, (1181), 796 states have internal predecessors, (1181), 269 states have call successors, (269), 27 states have call predecessors, (269), 27 states have return successors, (269), 265 states have call predecessors, (269), 269 states have call successors, (269) [2025-02-05 21:40:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1719 transitions. [2025-02-05 21:40:42,824 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1719 transitions. Word has length 560 [2025-02-05 21:40:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1719 transitions. [2025-02-05 21:40:42,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 13.5) internal successors, (270), 21 states have internal predecessors, (270), 10 states have call successors, (189), 5 states have call predecessors, (189), 9 states have return successors, (191), 10 states have call predecessors, (191), 10 states have call successors, (191) [2025-02-05 21:40:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1719 transitions. [2025-02-05 21:40:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-02-05 21:40:42,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:42,831 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,843 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:40:43,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:43,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:43,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash 768304603, now seen corresponding path program 1 times [2025-02-05 21:40:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498101480] [2025-02-05 21:40:43,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:43,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-02-05 21:40:43,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-02-05 21:40:43,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:40:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498101480] [2025-02-05 21:40:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498101480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818262944] [2025-02-05 21:40:44,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:44,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:44,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:44,027 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:40:44,032 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:40:44,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-02-05 21:40:44,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-02-05 21:40:44,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:44,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:44,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-05 21:40:44,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 8799 proven. 468 refuted. 0 times theorem prover too weak. 6397 trivial. 0 not checked. [2025-02-05 21:40:46,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 114 proven. 150 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:40:48,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818262944] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:48,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 15] total 33 [2025-02-05 21:40:48,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087688368] [2025-02-05 21:40:48,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:48,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 21:40:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:48,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 21:40:48,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:40:48,403 INFO L87 Difference]: Start difference. First operand 1089 states and 1719 transitions. Second operand has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 32 states have internal predecessors, (285), 7 states have call successors, (238), 5 states have call predecessors, (238), 9 states have return successors, (239), 7 states have call predecessors, (239), 7 states have call successors, (239) [2025-02-05 21:41:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:16,403 INFO L93 Difference]: Finished difference Result 28571 states and 46119 transitions. [2025-02-05 21:41:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 310 states. [2025-02-05 21:41:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 32 states have internal predecessors, (285), 7 states have call successors, (238), 5 states have call predecessors, (238), 9 states have return successors, (239), 7 states have call predecessors, (239), 7 states have call successors, (239) Word has length 560 [2025-02-05 21:41:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:16,504 INFO L225 Difference]: With dead ends: 28571 [2025-02-05 21:41:16,504 INFO L226 Difference]: Without dead ends: 27485 [2025-02-05 21:41:16,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1465 GetRequests, 1138 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49727 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=13310, Invalid=94602, Unknown=0, NotChecked=0, Total=107912 [2025-02-05 21:41:16,528 INFO L435 NwaCegarLoop]: 1304 mSDtfsCounter, 31181 mSDsluCounter, 14255 mSDsCounter, 0 mSdLazyCounter, 12562 mSolverCounterSat, 6129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31245 SdHoareTripleChecker+Valid, 15559 SdHoareTripleChecker+Invalid, 18691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6129 IncrementalHoareTripleChecker+Valid, 12562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:16,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31245 Valid, 15559 Invalid, 18691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6129 Valid, 12562 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2025-02-05 21:41:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27485 states. [2025-02-05 21:41:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27485 to 9836. [2025-02-05 21:41:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9836 states, 8045 states have (on average 1.5742697327532629) internal successors, (12665), 8096 states have internal predecessors, (12665), 1636 states have call successors, (1636), 154 states have call predecessors, (1636), 154 states have return successors, (1636), 1585 states have call predecessors, (1636), 1636 states have call successors, (1636) [2025-02-05 21:41:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9836 states to 9836 states and 15937 transitions. [2025-02-05 21:41:17,511 INFO L78 Accepts]: Start accepts. Automaton has 9836 states and 15937 transitions. Word has length 560 [2025-02-05 21:41:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:17,513 INFO L471 AbstractCegarLoop]: Abstraction has 9836 states and 15937 transitions. [2025-02-05 21:41:17,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 32 states have internal predecessors, (285), 7 states have call successors, (238), 5 states have call predecessors, (238), 9 states have return successors, (239), 7 states have call predecessors, (239), 7 states have call successors, (239) [2025-02-05 21:41:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 9836 states and 15937 transitions. [2025-02-05 21:41:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-02-05 21:41:17,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:17,526 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:17,538 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:41:17,727 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,SelfDestructingSolverStorable5 [2025-02-05 21:41:17,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:17,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1686682522, now seen corresponding path program 1 times [2025-02-05 21:41:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108211430] [2025-02-05 21:41:17,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:17,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-02-05 21:41:17,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-02-05 21:41:17,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:17,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-05 21:41:18,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108211430] [2025-02-05 21:41:18,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108211430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:18,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:18,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:41:18,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210661832] [2025-02-05 21:41:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:18,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:41:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:18,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:41:18,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:41:18,072 INFO L87 Difference]: Start difference. First operand 9836 states and 15937 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:41:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:20,715 INFO L93 Difference]: Finished difference Result 36579 states and 59446 transitions. [2025-02-05 21:41:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:41:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 560 [2025-02-05 21:41:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:20,894 INFO L225 Difference]: With dead ends: 36579 [2025-02-05 21:41:20,896 INFO L226 Difference]: Without dead ends: 26746 [2025-02-05 21:41:20,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:41:20,941 INFO L435 NwaCegarLoop]: 1157 mSDtfsCounter, 1870 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 4081 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:20,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 4081 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:41:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26746 states. [2025-02-05 21:41:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26746 to 20945. [2025-02-05 21:41:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20945 states, 17662 states have (on average 1.5927980976106897) internal successors, (28132), 17759 states have internal predecessors, (28132), 3013 states have call successors, (3013), 269 states have call predecessors, (3013), 269 states have return successors, (3013), 2916 states have call predecessors, (3013), 3013 states have call successors, (3013) [2025-02-05 21:41:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20945 states to 20945 states and 34158 transitions. [2025-02-05 21:41:22,964 INFO L78 Accepts]: Start accepts. Automaton has 20945 states and 34158 transitions. Word has length 560 [2025-02-05 21:41:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:22,965 INFO L471 AbstractCegarLoop]: Abstraction has 20945 states and 34158 transitions. [2025-02-05 21:41:22,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:41:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 20945 states and 34158 transitions. [2025-02-05 21:41:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-02-05 21:41:22,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:22,978 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:22,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:41:22,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:22,979 INFO L85 PathProgramCache]: Analyzing trace with hash -761418564, now seen corresponding path program 1 times [2025-02-05 21:41:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:22,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465614326] [2025-02-05 21:41:22,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:22,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:23,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-02-05 21:41:23,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-02-05 21:41:23,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:23,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-05 21:41:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465614326] [2025-02-05 21:41:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465614326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:41:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914530976] [2025-02-05 21:41:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:23,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:41:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:23,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:41:23,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:41:23,284 INFO L87 Difference]: Start difference. First operand 20945 states and 34158 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:41:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:24,437 INFO L93 Difference]: Finished difference Result 38042 states and 62057 transitions. [2025-02-05 21:41:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:41:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 560 [2025-02-05 21:41:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:24,498 INFO L225 Difference]: With dead ends: 38042 [2025-02-05 21:41:24,499 INFO L226 Difference]: Without dead ends: 17100 [2025-02-05 21:41:24,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:41:24,531 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 299 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:24,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1528 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:41:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17100 states. [2025-02-05 21:41:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17100 to 10360. [2025-02-05 21:41:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10360 states, 8689 states have (on average 1.5848774312348948) internal successors, (13771), 8726 states have internal predecessors, (13771), 1496 states have call successors, (1496), 174 states have call predecessors, (1496), 174 states have return successors, (1496), 1459 states have call predecessors, (1496), 1496 states have call successors, (1496) [2025-02-05 21:41:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 16763 transitions. [2025-02-05 21:41:25,384 INFO L78 Accepts]: Start accepts. Automaton has 10360 states and 16763 transitions. Word has length 560 [2025-02-05 21:41:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:25,386 INFO L471 AbstractCegarLoop]: Abstraction has 10360 states and 16763 transitions. [2025-02-05 21:41:25,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:41:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 10360 states and 16763 transitions. [2025-02-05 21:41:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-02-05 21:41:25,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:25,395 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:25,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:41:25,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:25,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 233531247, now seen corresponding path program 1 times [2025-02-05 21:41:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:25,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177781611] [2025-02-05 21:41:25,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:25,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-02-05 21:41:25,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-02-05 21:41:25,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:25,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 108 proven. 156 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:41:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177781611] [2025-02-05 21:41:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177781611] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242940187] [2025-02-05 21:41:26,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:26,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:26,391 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:41:26,392 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:41:26,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-02-05 21:41:26,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-02-05 21:41:26,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:26,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:26,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 21:41:26,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 7702 proven. 306 refuted. 0 times theorem prover too weak. 7656 trivial. 0 not checked. [2025-02-05 21:41:28,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:41:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 216 proven. 309 refuted. 0 times theorem prover too weak. 15139 trivial. 0 not checked. [2025-02-05 21:41:31,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242940187] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:41:31,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:41:31,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 13] total 28 [2025-02-05 21:41:31,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086141971] [2025-02-05 21:41:31,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:41:31,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 21:41:31,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:31,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 21:41:31,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:41:31,663 INFO L87 Difference]: Start difference. First operand 10360 states and 16763 transitions. Second operand has 28 states, 26 states have (on average 11.153846153846153) internal successors, (290), 26 states have internal predecessors, (290), 8 states have call successors, (231), 4 states have call predecessors, (231), 8 states have return successors, (231), 7 states have call predecessors, (231), 8 states have call successors, (231) [2025-02-05 21:41:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:40,611 INFO L93 Difference]: Finished difference Result 40116 states and 64333 transitions. [2025-02-05 21:41:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-02-05 21:41:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 11.153846153846153) internal successors, (290), 26 states have internal predecessors, (290), 8 states have call successors, (231), 4 states have call predecessors, (231), 8 states have return successors, (231), 7 states have call predecessors, (231), 8 states have call successors, (231) Word has length 561 [2025-02-05 21:41:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:40,668 INFO L225 Difference]: With dead ends: 40116 [2025-02-05 21:41:40,669 INFO L226 Difference]: Without dead ends: 29810 [2025-02-05 21:41:40,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1244 GetRequests, 1118 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5758 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2938, Invalid=13318, Unknown=0, NotChecked=0, Total=16256 [2025-02-05 21:41:40,693 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 4913 mSDsluCounter, 7645 mSDsCounter, 0 mSdLazyCounter, 7023 mSolverCounterSat, 2155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5021 SdHoareTripleChecker+Valid, 8563 SdHoareTripleChecker+Invalid, 9178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2155 IncrementalHoareTripleChecker+Valid, 7023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:40,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5021 Valid, 8563 Invalid, 9178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2155 Valid, 7023 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 21:41:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29810 states. [2025-02-05 21:41:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29810 to 17604. [2025-02-05 21:41:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17604 states, 14914 states have (on average 1.587971033927853) internal successors, (23683), 14988 states have internal predecessors, (23683), 2437 states have call successors, (2437), 252 states have call predecessors, (2437), 252 states have return successors, (2437), 2363 states have call predecessors, (2437), 2437 states have call successors, (2437) [2025-02-05 21:41:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17604 states to 17604 states and 28557 transitions. [2025-02-05 21:41:41,909 INFO L78 Accepts]: Start accepts. Automaton has 17604 states and 28557 transitions. Word has length 561 [2025-02-05 21:41:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:41,910 INFO L471 AbstractCegarLoop]: Abstraction has 17604 states and 28557 transitions. [2025-02-05 21:41:41,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 11.153846153846153) internal successors, (290), 26 states have internal predecessors, (290), 8 states have call successors, (231), 4 states have call predecessors, (231), 8 states have return successors, (231), 7 states have call predecessors, (231), 8 states have call successors, (231) [2025-02-05 21:41:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 17604 states and 28557 transitions. [2025-02-05 21:41:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-02-05 21:41:41,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:41,918 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:41,926 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:41:42,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:42,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:42,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash -968238195, now seen corresponding path program 1 times [2025-02-05 21:41:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:42,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444091361] [2025-02-05 21:41:42,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:42,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-02-05 21:41:42,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-02-05 21:41:42,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:42,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 114 proven. 150 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:41:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444091361] [2025-02-05 21:41:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444091361] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:41:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448365610] [2025-02-05 21:41:42,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:42,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:41:42,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:41:42,510 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:41:42,512 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:41:42,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-02-05 21:41:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-02-05 21:41:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:42,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:41:42,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:41:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 7764 proven. 150 refuted. 0 times theorem prover too weak. 7750 trivial. 0 not checked. [2025-02-05 21:41:43,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:41:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 114 proven. 150 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-05 21:41:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448365610] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:41:43,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:41:43,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-05 21:41:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458089384] [2025-02-05 21:41:43,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:41:43,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:41:43,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:43,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:41:43,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:41:43,320 INFO L87 Difference]: Start difference. First operand 17604 states and 28557 transitions. Second operand has 14 states, 14 states have (on average 12.5) internal successors, (175), 14 states have internal predecessors, (175), 3 states have call successors, (189), 2 states have call predecessors, (189), 4 states have return successors, (190), 3 states have call predecessors, (190), 3 states have call successors, (190) [2025-02-05 21:41:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:45,977 INFO L93 Difference]: Finished difference Result 51148 states and 83231 transitions. [2025-02-05 21:41:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:41:45,978 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.5) internal successors, (175), 14 states have internal predecessors, (175), 3 states have call successors, (189), 2 states have call predecessors, (189), 4 states have return successors, (190), 3 states have call predecessors, (190), 3 states have call successors, (190) Word has length 561 [2025-02-05 21:41:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:46,075 INFO L225 Difference]: With dead ends: 51148 [2025-02-05 21:41:46,075 INFO L226 Difference]: Without dead ends: 33598 [2025-02-05 21:41:46,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1136 GetRequests, 1117 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:41:46,097 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 1172 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:46,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1750 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:41:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33598 states. [2025-02-05 21:41:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33598 to 23640. [2025-02-05 21:41:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23640 states, 20366 states have (on average 1.6000687420210153) internal successors, (32587), 20468 states have internal predecessors, (32587), 2985 states have call successors, (2985), 288 states have call predecessors, (2985), 288 states have return successors, (2985), 2883 states have call predecessors, (2985), 2985 states have call successors, (2985) [2025-02-05 21:41:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23640 states to 23640 states and 38557 transitions. [2025-02-05 21:41:47,748 INFO L78 Accepts]: Start accepts. Automaton has 23640 states and 38557 transitions. Word has length 561 [2025-02-05 21:41:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:47,749 INFO L471 AbstractCegarLoop]: Abstraction has 23640 states and 38557 transitions. [2025-02-05 21:41:47,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.5) internal successors, (175), 14 states have internal predecessors, (175), 3 states have call successors, (189), 2 states have call predecessors, (189), 4 states have return successors, (190), 3 states have call predecessors, (190), 3 states have call successors, (190) [2025-02-05 21:41:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23640 states and 38557 transitions. [2025-02-05 21:41:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-02-05 21:41:47,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:47,761 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:47,773 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:41:47,962 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,SelfDestructingSolverStorable9 [2025-02-05 21:41:47,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:47,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash -838751798, now seen corresponding path program 1 times [2025-02-05 21:41:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529777961] [2025-02-05 21:41:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:47,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-02-05 21:41:48,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-02-05 21:41:48,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:48,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-05 21:41:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529777961] [2025-02-05 21:41:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529777961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804341471] [2025-02-05 21:41:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:48,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:48,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:48,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:48,118 INFO L87 Difference]: Start difference. First operand 23640 states and 38557 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:41:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:51,365 INFO L93 Difference]: Finished difference Result 54262 states and 88135 transitions. [2025-02-05 21:41:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:51,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 561 [2025-02-05 21:41:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:51,434 INFO L225 Difference]: With dead ends: 54262 [2025-02-05 21:41:51,434 INFO L226 Difference]: Without dead ends: 30676 [2025-02-05 21:41:51,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:51,458 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 285 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:51,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 837 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:41:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30676 states. [2025-02-05 21:41:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30676 to 20730. [2025-02-05 21:41:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20730 states, 17456 states have (on average 1.5780820348304307) internal successors, (27547), 17558 states have internal predecessors, (27547), 2985 states have call successors, (2985), 288 states have call predecessors, (2985), 288 states have return successors, (2985), 2883 states have call predecessors, (2985), 2985 states have call successors, (2985) [2025-02-05 21:41:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20730 states to 20730 states and 33517 transitions. [2025-02-05 21:41:53,076 INFO L78 Accepts]: Start accepts. Automaton has 20730 states and 33517 transitions. Word has length 561 [2025-02-05 21:41:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:53,077 INFO L471 AbstractCegarLoop]: Abstraction has 20730 states and 33517 transitions. [2025-02-05 21:41:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-05 21:41:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20730 states and 33517 transitions. [2025-02-05 21:41:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-02-05 21:41:53,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:53,087 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:41:53,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:41:53,087 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:53,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1617260053, now seen corresponding path program 1 times [2025-02-05 21:41:53,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:53,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499471006] [2025-02-05 21:41:53,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:53,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:53,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-02-05 21:41:53,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-02-05 21:41:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-05 21:41:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:53,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499471006] [2025-02-05 21:41:53,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499471006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:53,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:53,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:41:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537918172] [2025-02-05 21:41:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:53,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:41:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:53,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:41:53,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:41:53,467 INFO L87 Difference]: Start difference. First operand 20730 states and 33517 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89)