./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.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_variablewrapping_wrapper-s_file-97.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:58:33,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:58:33,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:58:33,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:58:33,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:58:33,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:58:33,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:58:33,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:58:33,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:58:33,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:58:33,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:58:33,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:58:33,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:58:33,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:58:33,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:58:33,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:58:33,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:58:33,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:58:33,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:58:33,280 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2025-02-06 03:58:33,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:58:33,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:58:33,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:58:33,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:58:33,496 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:58:33,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2025-02-06 03:58:34,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8c7c6dd9/1a04eb718f344ca19707240ed800e7fe/FLAGc8d793d0f [2025-02-06 03:58:34,982 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:58:34,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2025-02-06 03:58:34,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8c7c6dd9/1a04eb718f344ca19707240ed800e7fe/FLAGc8d793d0f [2025-02-06 03:58:35,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8c7c6dd9/1a04eb718f344ca19707240ed800e7fe [2025-02-06 03:58:35,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:58:35,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:58:35,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:58:35,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:58:35,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:58:35,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af7d75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35, skipping insertion in model container [2025-02-06 03:58:35,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:58:35,451 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_variablewrapping_wrapper-s_file-97.i[916,929] [2025-02-06 03:58:35,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:58:35,500 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:58:35,507 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_variablewrapping_wrapper-s_file-97.i[916,929] [2025-02-06 03:58:35,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:58:35,540 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:58:35,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35 WrapperNode [2025-02-06 03:58:35,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:58:35,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:58:35,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:58:35,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:58:35,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,575 INFO L138 Inliner]: procedures = 30, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2025-02-06 03:58:35,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:58:35,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:58:35,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:58:35,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:58:35,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,590 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:58:35,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:58:35,610 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:58:35,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:58:35,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:58:35,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (1/1) ... [2025-02-06 03:58:35,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:58:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:35,633 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-06 03:58:35,637 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-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:58:35,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:58:35,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:58:35,719 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:58:35,720 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:58:36,081 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem64#1;havoc property_#t~ite77#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite76#1;havoc property_#t~mem67#1;havoc property_#t~ite74#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem73#1;havoc property_#t~mem72#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem83#1;havoc property_#t~bitwise84#1;havoc property_#t~mem85#1;havoc property_#t~ite90#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~ite103#1;havoc property_#t~mem97#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short96#1;havoc property_#t~mem102#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2025-02-06 03:58:36,103 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-06 03:58:36,104 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:58:36,114 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:58:36,114 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:58:36,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:58:36 BoogieIcfgContainer [2025-02-06 03:58:36,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:58:36,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:58:36,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:58:36,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:58:36,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:58:35" (1/3) ... [2025-02-06 03:58:36,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43048fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:58:36, skipping insertion in model container [2025-02-06 03:58:36,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:58:35" (2/3) ... [2025-02-06 03:58:36,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43048fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:58:36, skipping insertion in model container [2025-02-06 03:58:36,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:58:36" (3/3) ... [2025-02-06 03:58:36,123 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2025-02-06 03:58:36,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:58:36,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-97.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:58:36,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:58:36,188 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;@14262f23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:58:36,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:58:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 88 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:58:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:58:36,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:36,201 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:36,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:36,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:36,205 INFO L85 PathProgramCache]: Analyzing trace with hash -339878505, now seen corresponding path program 1 times [2025-02-06 03:58:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665759388] [2025-02-06 03:58:36,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:36,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:36,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:36,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:36,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:58:36,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665759388] [2025-02-06 03:58:36,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665759388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671837712] [2025-02-06 03:58:36,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:36,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:36,581 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-06 03:58:36,588 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-06 03:58:36,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:36,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:36,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:36,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:58:36,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 03:58:36,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:58:36,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671837712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:36,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:58:36,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:58:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368365667] [2025-02-06 03:58:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:58:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:36,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:58:36,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:58:36,835 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 88 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:58:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:36,858 INFO L93 Difference]: Finished difference Result 208 states and 322 transitions. [2025-02-06 03:58:36,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:58:36,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-02-06 03:58:36,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:36,866 INFO L225 Difference]: With dead ends: 208 [2025-02-06 03:58:36,867 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:58:36,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-06 03:58:36,871 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:36,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:58:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:58:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-06 03:58:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:58:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2025-02-06 03:58:36,910 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 134 [2025-02-06 03:58:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:36,911 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2025-02-06 03:58:36,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:58:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2025-02-06 03:58:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:58:36,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:36,914 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:36,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:58:37,114 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-06 03:58:37,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:37,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash -266870010, now seen corresponding path program 1 times [2025-02-06 03:58:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022110886] [2025-02-06 03:58:37,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:37,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:37,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:37,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:37,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:37,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:37,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022110886] [2025-02-06 03:58:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022110886] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:37,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323668241] [2025-02-06 03:58:37,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:37,563 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-06 03:58:37,564 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-06 03:58:37,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:37,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:37,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:37,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:37,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:58:37,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:37,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:58:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323668241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:58:37,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:58:37,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246449489] [2025-02-06 03:58:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:58:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:37,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:58:37,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:37,759 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:37,802 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2025-02-06 03:58:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:58:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:58:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:37,806 INFO L225 Difference]: With dead ends: 208 [2025-02-06 03:58:37,807 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 03:58:37,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:37,808 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:37,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:58:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 03:58:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-02-06 03:58:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:58:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2025-02-06 03:58:37,820 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 134 [2025-02-06 03:58:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:37,823 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2025-02-06 03:58:37,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2025-02-06 03:58:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:58:37,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:37,824 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:37,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:58:38,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:38,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:38,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2074324473, now seen corresponding path program 1 times [2025-02-06 03:58:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:38,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663634140] [2025-02-06 03:58:38,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:38,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:38,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:38,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663634140] [2025-02-06 03:58:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663634140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600184310] [2025-02-06 03:58:38,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:38,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:38,261 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-06 03:58:38,264 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-06 03:58:38,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:38,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:38,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:38,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:38,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:58:38,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:38,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:58:38,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600184310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:38,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:58:38,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:58:38,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355600951] [2025-02-06 03:58:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:38,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:58:38,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:38,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:58:38,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:38,490 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:38,513 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2025-02-06 03:58:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:58:38,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:58:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:38,514 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:58:38,514 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:58:38,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:38,515 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:38,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:58:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:58:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-02-06 03:58:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:58:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-02-06 03:58:38,521 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 134 [2025-02-06 03:58:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:38,521 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-02-06 03:58:38,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-02-06 03:58:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:58:38,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:38,523 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:38,529 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-06 03:58:38,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:38,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:38,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1186820792, now seen corresponding path program 1 times [2025-02-06 03:58:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610934801] [2025-02-06 03:58:38,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:38,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610934801] [2025-02-06 03:58:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610934801] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862627734] [2025-02-06 03:58:38,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:38,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:38,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:38,912 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-06 03:58:38,914 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-06 03:58:39,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:39,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:58:39,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:39,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:58:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862627734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:39,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:58:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:58:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771502949] [2025-02-06 03:58:39,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:39,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:58:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:39,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:58:39,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:39,125 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:39,154 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2025-02-06 03:58:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:58:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:58:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:39,156 INFO L225 Difference]: With dead ends: 216 [2025-02-06 03:58:39,157 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 03:58:39,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:39,158 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:39,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 427 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:58:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 03:58:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-02-06 03:58:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:58:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-02-06 03:58:39,172 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 134 [2025-02-06 03:58:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:39,172 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-02-06 03:58:39,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-02-06 03:58:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:58:39,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:39,175 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:39,183 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-06 03:58:39,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:39,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1185897271, now seen corresponding path program 1 times [2025-02-06 03:58:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578616595] [2025-02-06 03:58:39,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:39,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:39,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:39,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:39,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578616595] [2025-02-06 03:58:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578616595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744857465] [2025-02-06 03:58:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:39,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:39,560 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-06 03:58:39,561 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-06 03:58:39,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:58:39,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:58:39,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:39,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:39,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:58:39,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:39,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:58:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744857465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:39,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:58:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:58:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432344706] [2025-02-06 03:58:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:39,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:58:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:39,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:58:39,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:58:39,769 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:39,796 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2025-02-06 03:58:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:58:39,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:58:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:39,800 INFO L225 Difference]: With dead ends: 219 [2025-02-06 03:58:39,800 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 03:58:39,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:58:39,801 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:39,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:58:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 03:58:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 03:58:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:58:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-02-06 03:58:39,810 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 134 [2025-02-06 03:58:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:39,810 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-02-06 03:58:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-02-06 03:58:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:58:39,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:39,811 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:39,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:58:40,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:40,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1747616189, now seen corresponding path program 1 times [2025-02-06 03:58:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407464784] [2025-02-06 03:58:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:40,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:58:40,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:58:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:40,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:40,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407464784] [2025-02-06 03:58:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407464784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:40,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:40,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:58:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058380775] [2025-02-06 03:58:40,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:40,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:58:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:40,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:58:40,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:58:40,518 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:41,048 INFO L93 Difference]: Finished difference Result 312 states and 439 transitions. [2025-02-06 03:58:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:58:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:58:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:41,050 INFO L225 Difference]: With dead ends: 312 [2025-02-06 03:58:41,050 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 03:58:41,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:41,051 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 237 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:41,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 381 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:58:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 03:58:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 114. [2025-02-06 03:58:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:58:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2025-02-06 03:58:41,067 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 136 [2025-02-06 03:58:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:41,067 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2025-02-06 03:58:41,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2025-02-06 03:58:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:58:41,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:41,068 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:41,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:58:41,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:41,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1156311001, now seen corresponding path program 1 times [2025-02-06 03:58:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:41,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522650737] [2025-02-06 03:58:41,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:41,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:58:41,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:58:41,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:41,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522650737] [2025-02-06 03:58:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522650737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206201942] [2025-02-06 03:58:41,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:41,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:41,982 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-06 03:58:41,984 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-06 03:58:42,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:58:42,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:58:42,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:42,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:42,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:58:42,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:42,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:42,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:42,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:42,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2025-02-06 03:58:42,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:42,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2025-02-06 03:58:42,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:42,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 50 [2025-02-06 03:58:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-06 03:58:42,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:58:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206201942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:58:42,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:58:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 18 [2025-02-06 03:58:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449867264] [2025-02-06 03:58:42,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:58:42,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:58:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:58:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:58:42,669 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 18 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:58:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:44,000 INFO L93 Difference]: Finished difference Result 374 states and 516 transitions. [2025-02-06 03:58:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 03:58:44,001 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 136 [2025-02-06 03:58:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:44,003 INFO L225 Difference]: With dead ends: 374 [2025-02-06 03:58:44,003 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 03:58:44,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 264 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 03:58:44,004 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 231 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:44,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1010 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:58:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 03:58:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 248. [2025-02-06 03:58:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 201 states have internal predecessors, (257), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:58:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 341 transitions. [2025-02-06 03:58:44,023 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 341 transitions. Word has length 136 [2025-02-06 03:58:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:44,024 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 341 transitions. [2025-02-06 03:58:44,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:58:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 341 transitions. [2025-02-06 03:58:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:58:44,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:44,025 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:44,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:58:44,230 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,SelfDestructingSolverStorable6 [2025-02-06 03:58:44,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:44,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1223317754, now seen corresponding path program 1 times [2025-02-06 03:58:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234325349] [2025-02-06 03:58:44,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:44,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:58:44,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:58:44,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:44,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234325349] [2025-02-06 03:58:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234325349] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803960323] [2025-02-06 03:58:44,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:44,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:44,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:44,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:58:44,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:58:44,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:58:44,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:58:44,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:44,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:44,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:58:45,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:45,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:45,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:45,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:45,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:45,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2025-02-06 03:58:45,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:45,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 28 [2025-02-06 03:58:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-06 03:58:45,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:58:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:45,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803960323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:58:45,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:58:45,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2025-02-06 03:58:45,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547139093] [2025-02-06 03:58:45,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:58:45,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:58:45,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:45,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:58:45,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:58:45,329 INFO L87 Difference]: Start difference. First operand 248 states and 341 transitions. Second operand has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2025-02-06 03:58:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:45,954 INFO L93 Difference]: Finished difference Result 492 states and 670 transitions. [2025-02-06 03:58:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:58:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 136 [2025-02-06 03:58:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:45,957 INFO L225 Difference]: With dead ends: 492 [2025-02-06 03:58:45,957 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 03:58:45,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 266 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:58:45,958 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 354 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:45,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 421 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:58:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 03:58:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 259. [2025-02-06 03:58:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 208 states have internal predecessors, (263), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:58:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 351 transitions. [2025-02-06 03:58:45,982 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 351 transitions. Word has length 136 [2025-02-06 03:58:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 351 transitions. [2025-02-06 03:58:45,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2025-02-06 03:58:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 351 transitions. [2025-02-06 03:58:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:58:45,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:45,983 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:45,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 03:58:46,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:46,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -459150165, now seen corresponding path program 1 times [2025-02-06 03:58:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154421969] [2025-02-06 03:58:46,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:46,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:58:46,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:58:46,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:46,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:46,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154421969] [2025-02-06 03:58:46,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154421969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896397028] [2025-02-06 03:58:46,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:46,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:46,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:46,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:58:46,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:58:47,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:58:47,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:58:47,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:47,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:47,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:58:47,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:47,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:47,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:47,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 03:58:47,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:47,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2025-02-06 03:58:47,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:47,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2025-02-06 03:58:47,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:58:47,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 50 [2025-02-06 03:58:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-06 03:58:47,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:58:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896397028] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:58:47,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:58:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 21 [2025-02-06 03:58:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55418476] [2025-02-06 03:58:47,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:58:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 03:58:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:47,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 03:58:47,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:58:47,679 INFO L87 Difference]: Start difference. First operand 259 states and 351 transitions. Second operand has 21 states, 17 states have (on average 5.470588235294118) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-02-06 03:58:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:49,276 INFO L93 Difference]: Finished difference Result 538 states and 720 transitions. [2025-02-06 03:58:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 03:58:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 5.470588235294118) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) Word has length 136 [2025-02-06 03:58:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:49,278 INFO L225 Difference]: With dead ends: 538 [2025-02-06 03:58:49,278 INFO L226 Difference]: Without dead ends: 303 [2025-02-06 03:58:49,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 266 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 03:58:49,279 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 329 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:49,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1171 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:58:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-06 03:58:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 176. [2025-02-06 03:58:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 135 states have internal predecessors, (166), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:58:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 234 transitions. [2025-02-06 03:58:49,292 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 234 transitions. Word has length 136 [2025-02-06 03:58:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:49,292 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 234 transitions. [2025-02-06 03:58:49,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 5.470588235294118) internal successors, (93), 21 states have internal predecessors, (93), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-02-06 03:58:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 234 transitions. [2025-02-06 03:58:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:58:49,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:49,293 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:49,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:58:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:49,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:49,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1380994527, now seen corresponding path program 1 times [2025-02-06 03:58:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703915872] [2025-02-06 03:58:49,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:49,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:58:49,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:58:49,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:49,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:49,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703915872] [2025-02-06 03:58:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703915872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:49,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:58:49,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429326091] [2025-02-06 03:58:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:49,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:58:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:49,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:58:49,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:58:49,726 INFO L87 Difference]: Start difference. First operand 176 states and 234 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:50,014 INFO L93 Difference]: Finished difference Result 421 states and 562 transitions. [2025-02-06 03:58:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:58:50,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-02-06 03:58:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:50,016 INFO L225 Difference]: With dead ends: 421 [2025-02-06 03:58:50,018 INFO L226 Difference]: Without dead ends: 300 [2025-02-06 03:58:50,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:58:50,018 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 129 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:50,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 949 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:58:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-06 03:58:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 180. [2025-02-06 03:58:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 139 states have internal predecessors, (172), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:58:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2025-02-06 03:58:50,033 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 137 [2025-02-06 03:58:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:50,033 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2025-02-06 03:58:50,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2025-02-06 03:58:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:58:50,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:50,035 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:58:50,035 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1972299715, now seen corresponding path program 1 times [2025-02-06 03:58:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693510710] [2025-02-06 03:58:50,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:50,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:58:50,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:58:50,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:50,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693510710] [2025-02-06 03:58:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693510710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:50,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:58:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126197725] [2025-02-06 03:58:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:50,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:58:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:50,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:58:50,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:58:50,327 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:50,489 INFO L93 Difference]: Finished difference Result 305 states and 408 transitions. [2025-02-06 03:58:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:58:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-02-06 03:58:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:50,491 INFO L225 Difference]: With dead ends: 305 [2025-02-06 03:58:50,491 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 03:58:50,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:50,492 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 209 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:50,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 182 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:58:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 03:58:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-06 03:58:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2318840579710144) internal successors, (170), 139 states have internal predecessors, (170), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:58:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 238 transitions. [2025-02-06 03:58:50,503 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 238 transitions. Word has length 137 [2025-02-06 03:58:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:50,503 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 238 transitions. [2025-02-06 03:58:50,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 238 transitions. [2025-02-06 03:58:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:58:50,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:50,504 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:50,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:58:50,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2117094528, now seen corresponding path program 1 times [2025-02-06 03:58:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279947900] [2025-02-06 03:58:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:50,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:58:50,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:58:50,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279947900] [2025-02-06 03:58:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279947900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:58:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400927525] [2025-02-06 03:58:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:51,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:58:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:58:51,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:58:51,175 INFO L87 Difference]: Start difference. First operand 180 states and 238 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:58:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:51,643 INFO L93 Difference]: Finished difference Result 404 states and 533 transitions. [2025-02-06 03:58:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:58:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2025-02-06 03:58:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:51,645 INFO L225 Difference]: With dead ends: 404 [2025-02-06 03:58:51,646 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 03:58:51,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:51,646 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 105 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:51,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 755 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:58:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 03:58:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 180. [2025-02-06 03:58:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 139 states have internal predecessors, (169), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:58:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 237 transitions. [2025-02-06 03:58:51,662 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 237 transitions. Word has length 138 [2025-02-06 03:58:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:51,662 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 237 transitions. [2025-02-06 03:58:51,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:58:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 237 transitions. [2025-02-06 03:58:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:58:51,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:51,663 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:51,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:58:51,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1766622655, now seen corresponding path program 1 times [2025-02-06 03:58:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:51,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041479392] [2025-02-06 03:58:51,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:58:51,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:58:51,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:51,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:52,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:52,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041479392] [2025-02-06 03:58:52,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041479392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:52,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:52,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:58:52,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077391653] [2025-02-06 03:58:52,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:52,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:58:52,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:52,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:58:52,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:58:52,141 INFO L87 Difference]: Start difference. First operand 180 states and 237 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:52,386 INFO L93 Difference]: Finished difference Result 399 states and 524 transitions. [2025-02-06 03:58:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:58:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:58:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:52,388 INFO L225 Difference]: With dead ends: 399 [2025-02-06 03:58:52,388 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 03:58:52,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-06 03:58:52,388 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 104 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:52,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 341 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:58:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 03:58:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 180. [2025-02-06 03:58:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2173913043478262) internal successors, (168), 139 states have internal predecessors, (168), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:58:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 236 transitions. [2025-02-06 03:58:52,401 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 236 transitions. Word has length 139 [2025-02-06 03:58:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 236 transitions. [2025-02-06 03:58:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 236 transitions. [2025-02-06 03:58:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:58:52,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:52,402 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:52,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:58:52,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:52,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash 315478973, now seen corresponding path program 1 times [2025-02-06 03:58:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142943873] [2025-02-06 03:58:52,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:52,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:58:52,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:58:52,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:52,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142943873] [2025-02-06 03:58:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142943873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:53,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:53,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:58:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592055529] [2025-02-06 03:58:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:53,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:58:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:53,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:58:53,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:58:53,593 INFO L87 Difference]: Start difference. First operand 180 states and 236 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:53,971 INFO L93 Difference]: Finished difference Result 380 states and 497 transitions. [2025-02-06 03:58:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:58:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:58:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:53,973 INFO L225 Difference]: With dead ends: 380 [2025-02-06 03:58:53,973 INFO L226 Difference]: Without dead ends: 255 [2025-02-06 03:58:53,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:58:53,974 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 70 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:53,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 994 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:58:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-06 03:58:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2025-02-06 03:58:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 203 states have (on average 1.2315270935960592) internal successors, (250), 205 states have internal predecessors, (250), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:58:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 330 transitions. [2025-02-06 03:58:53,995 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 330 transitions. Word has length 139 [2025-02-06 03:58:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:53,995 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 330 transitions. [2025-02-06 03:58:53,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 330 transitions. [2025-02-06 03:58:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:58:53,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:53,997 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:53,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:58:53,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:53,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1250841762, now seen corresponding path program 1 times [2025-02-06 03:58:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:53,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882422477] [2025-02-06 03:58:53,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:54,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:58:54,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:58:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:55,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:55,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882422477] [2025-02-06 03:58:55,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882422477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:55,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:58:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813496813] [2025-02-06 03:58:55,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:55,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:58:55,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:55,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:58:55,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:58:55,520 INFO L87 Difference]: Start difference. First operand 252 states and 330 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:55,864 INFO L93 Difference]: Finished difference Result 550 states and 720 transitions. [2025-02-06 03:58:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:58:55,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-02-06 03:58:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:55,866 INFO L225 Difference]: With dead ends: 550 [2025-02-06 03:58:55,866 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 03:58:55,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:58:55,867 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 54 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:55,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 847 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:58:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 03:58:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 262. [2025-02-06 03:58:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 215 states have internal predecessors, (262), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:58:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 342 transitions. [2025-02-06 03:58:55,900 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 342 transitions. Word has length 140 [2025-02-06 03:58:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:55,900 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 342 transitions. [2025-02-06 03:58:55,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 342 transitions. [2025-02-06 03:58:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:58:55,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:55,901 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:55,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:58:55,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1690815837, now seen corresponding path program 1 times [2025-02-06 03:58:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745563186] [2025-02-06 03:58:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:55,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:58:55,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:58:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745563186] [2025-02-06 03:58:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745563186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:58:56,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396536920] [2025-02-06 03:58:56,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:56,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:58:56,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:56,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:58:56,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:58:56,234 INFO L87 Difference]: Start difference. First operand 262 states and 342 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:56,488 INFO L93 Difference]: Finished difference Result 469 states and 612 transitions. [2025-02-06 03:58:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:58:56,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-02-06 03:58:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:56,490 INFO L225 Difference]: With dead ends: 469 [2025-02-06 03:58:56,490 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 03:58:56,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:58:56,491 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 201 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:56,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 219 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:58:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 03:58:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-02-06 03:58:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.2112676056338028) internal successors, (258), 215 states have internal predecessors, (258), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:58:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 338 transitions. [2025-02-06 03:58:56,508 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 338 transitions. Word has length 140 [2025-02-06 03:58:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 338 transitions. [2025-02-06 03:58:56,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 338 transitions. [2025-02-06 03:58:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:58:56,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:56,510 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:56,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:58:56,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:56,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1462192675, now seen corresponding path program 1 times [2025-02-06 03:58:56,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:56,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533361686] [2025-02-06 03:58:56,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:56,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:56,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:58:56,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:58:56,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:56,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:56,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:56,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533361686] [2025-02-06 03:58:56,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533361686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:56,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:56,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:58:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397954017] [2025-02-06 03:58:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:56,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:58:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:56,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:58:56,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:58:56,731 INFO L87 Difference]: Start difference. First operand 262 states and 338 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:57,013 INFO L93 Difference]: Finished difference Result 453 states and 586 transitions. [2025-02-06 03:58:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:58:57,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-02-06 03:58:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:57,015 INFO L225 Difference]: With dead ends: 453 [2025-02-06 03:58:57,015 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 03:58:57,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:58:57,016 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 205 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:57,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 226 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:58:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 03:58:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-06 03:58:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 197 states have (on average 1.2081218274111676) internal successors, (238), 199 states have internal predecessors, (238), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:58:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 318 transitions. [2025-02-06 03:58:57,033 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 318 transitions. Word has length 140 [2025-02-06 03:58:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:57,033 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 318 transitions. [2025-02-06 03:58:57,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2025-02-06 03:58:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:58:57,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:57,035 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:57,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:58:57,035 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:57,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1053301031, now seen corresponding path program 1 times [2025-02-06 03:58:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:57,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769749320] [2025-02-06 03:58:57,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:57,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:58:57,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:58:57,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:57,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769749320] [2025-02-06 03:58:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769749320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:57,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:58:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621236517] [2025-02-06 03:58:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:57,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:58:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:57,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:58:57,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:58:57,358 INFO L87 Difference]: Start difference. First operand 246 states and 318 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:58:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:57,512 INFO L93 Difference]: Finished difference Result 437 states and 564 transitions. [2025-02-06 03:58:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:58:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2025-02-06 03:58:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:57,514 INFO L225 Difference]: With dead ends: 437 [2025-02-06 03:58:57,514 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 03:58:57,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:58:57,515 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 175 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:57,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 161 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:58:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 03:58:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-06 03:58:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 199 states have internal predecessors, (237), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:58:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 317 transitions. [2025-02-06 03:58:57,535 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 317 transitions. Word has length 142 [2025-02-06 03:58:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 317 transitions. [2025-02-06 03:58:57,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:58:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 317 transitions. [2025-02-06 03:58:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:58:57,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:57,536 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:58:57,536 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:57,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1940959126, now seen corresponding path program 1 times [2025-02-06 03:58:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:57,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108762598] [2025-02-06 03:58:57,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:57,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:58:57,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:58:57,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108762598] [2025-02-06 03:58:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108762598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:58:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076434903] [2025-02-06 03:58:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:58:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:58,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:58:58,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:58:58,255 INFO L87 Difference]: Start difference. First operand 246 states and 317 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:58,830 INFO L93 Difference]: Finished difference Result 668 states and 859 transitions. [2025-02-06 03:58:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:58:58,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:58:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:58,833 INFO L225 Difference]: With dead ends: 668 [2025-02-06 03:58:58,833 INFO L226 Difference]: Without dead ends: 477 [2025-02-06 03:58:58,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:58:58,833 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 207 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:58,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 628 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:58:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-06 03:58:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 372. [2025-02-06 03:58:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 302 states have (on average 1.2152317880794703) internal successors, (367), 304 states have internal predecessors, (367), 57 states have call successors, (57), 12 states have call predecessors, (57), 12 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:58:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 481 transitions. [2025-02-06 03:58:58,858 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 481 transitions. Word has length 143 [2025-02-06 03:58:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:58,858 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 481 transitions. [2025-02-06 03:58:58,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 481 transitions. [2025-02-06 03:58:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:58:58,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:58,859 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:58,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:58:58,859 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:58,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:58,860 INFO L85 PathProgramCache]: Analyzing trace with hash 79689589, now seen corresponding path program 1 times [2025-02-06 03:58:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477804867] [2025-02-06 03:58:58,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:58,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:58:58,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:58:58,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:58,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 03:58:58,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477804867] [2025-02-06 03:58:58,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477804867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:58:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119288735] [2025-02-06 03:58:58,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:58,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:58,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:58:58,978 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:58:58,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 03:58:59,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:58:59,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:58:59,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:59,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:59,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:58:59,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:58:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:59,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:58:59,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119288735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:59,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:58:59,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:58:59,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580648765] [2025-02-06 03:58:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:59,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:58:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:59,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:58:59,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:58:59,234 INFO L87 Difference]: Start difference. First operand 372 states and 481 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:58:59,281 INFO L93 Difference]: Finished difference Result 701 states and 905 transitions. [2025-02-06 03:58:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:58:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:58:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:58:59,284 INFO L225 Difference]: With dead ends: 701 [2025-02-06 03:58:59,284 INFO L226 Difference]: Without dead ends: 384 [2025-02-06 03:58:59,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:58:59,285 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:58:59,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:58:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-06 03:58:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2025-02-06 03:58:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 311 states have (on average 1.2090032154340835) internal successors, (376), 313 states have internal predecessors, (376), 57 states have call successors, (57), 12 states have call predecessors, (57), 12 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:58:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 490 transitions. [2025-02-06 03:58:59,311 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 490 transitions. Word has length 143 [2025-02-06 03:58:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:58:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 490 transitions. [2025-02-06 03:58:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:58:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 490 transitions. [2025-02-06 03:58:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:58:59,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:58:59,312 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:58:59,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:58:59,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:58:59,513 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:58:59,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:58:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -214334442, now seen corresponding path program 1 times [2025-02-06 03:58:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:58:59,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33083852] [2025-02-06 03:58:59,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:58:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:58:59,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:58:59,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:58:59,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:58:59,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:58:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:58:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:58:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33083852] [2025-02-06 03:58:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33083852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:58:59,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:58:59,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:58:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370005983] [2025-02-06 03:58:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:58:59,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:58:59,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:58:59,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:58:59,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:58:59,837 INFO L87 Difference]: Start difference. First operand 381 states and 490 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:00,032 INFO L93 Difference]: Finished difference Result 392 states and 503 transitions. [2025-02-06 03:59:00,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:59:00,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-02-06 03:59:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:00,036 INFO L225 Difference]: With dead ends: 392 [2025-02-06 03:59:00,037 INFO L226 Difference]: Without dead ends: 390 [2025-02-06 03:59:00,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:59:00,038 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 72 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:00,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 530 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:59:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-06 03:59:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-02-06 03:59:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 320 states have (on average 1.203125) internal successors, (385), 322 states have internal predecessors, (385), 57 states have call successors, (57), 12 states have call predecessors, (57), 12 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:59:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 499 transitions. [2025-02-06 03:59:00,066 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 499 transitions. Word has length 143 [2025-02-06 03:59:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:00,066 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 499 transitions. [2025-02-06 03:59:00,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 499 transitions. [2025-02-06 03:59:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:59:00,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:00,068 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:00,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:59:00,068 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash -213410921, now seen corresponding path program 1 times [2025-02-06 03:59:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:59:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729402746] [2025-02-06 03:59:00,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:59:00,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:59:00,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:59:00,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:00,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:59:00,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:59:00,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:59:00,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:59:00,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:00,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:59:00,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:59:00,208 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:59:00,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:59:00,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:59:00,215 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:59:00,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:59:00,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:59:00 BoogieIcfgContainer [2025-02-06 03:59:00,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:59:00,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:59:00,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:59:00,270 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:59:00,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:58:36" (3/4) ... [2025-02-06 03:59:00,272 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:59:00,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:59:00,273 INFO L158 Benchmark]: Toolchain (without parser) took 24964.26ms. Allocated memory was 167.8MB in the beginning and 981.5MB in the end (delta: 813.7MB). Free memory was 122.2MB in the beginning and 522.3MB in the end (delta: -400.1MB). Peak memory consumption was 412.5MB. Max. memory is 16.1GB. [2025-02-06 03:59:00,273 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:59:00,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.87ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:59:00,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.42ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 102.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:59:00,274 INFO L158 Benchmark]: Boogie Preprocessor took 33.48ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:59:00,274 INFO L158 Benchmark]: IcfgBuilder took 504.79ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 69.7MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:59:00,274 INFO L158 Benchmark]: TraceAbstraction took 24153.48ms. Allocated memory was 167.8MB in the beginning and 981.5MB in the end (delta: 813.7MB). Free memory was 69.0MB in the beginning and 522.5MB in the end (delta: -453.6MB). Peak memory consumption was 362.2MB. Max. memory is 16.1GB. [2025-02-06 03:59:00,275 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 981.5MB. Free memory was 522.5MB in the beginning and 522.3MB in the end (delta: 207.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:59:00,276 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.87ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.42ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 102.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.48ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 100.0MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 504.79ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 69.7MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24153.48ms. Allocated memory was 167.8MB in the beginning and 981.5MB in the end (delta: 813.7MB). Free memory was 69.0MB in the beginning and 522.5MB in the end (delta: -453.6MB). Peak memory consumption was 362.2MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 981.5MB. Free memory was 522.5MB in the beginning and 522.3MB in the end (delta: 207.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 115. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L90] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L60] EXPR WrapperStruct00.var_1_19 [L60] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L61] EXPR WrapperStruct00.var_1_21 [L61] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L62] EXPR WrapperStruct00.var_1_12 [L62] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_12 [L63] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L63] COND TRUE 127.5f > WrapperStruct00.var_1_20 [L64] EXPR WrapperStruct00.var_1_15 [L64] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 [L64] EXPR WrapperStruct00.var_1_16 [L64] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] WrapperStruct00.var_1_13 = (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16) [L68] EXPR WrapperStruct00.var_1_18 [L68] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND TRUE WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7 [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)) [L77] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] COND TRUE WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_10 [L78] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] COND FALSE !(WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) [L85] WrapperStruct00.var_1_1 = 8 VAL [WrapperStruct00={4:0}, isInitial=1] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_11 [L120] EXPR WrapperStruct00.var_1_12 [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) [L120] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) [L120] EXPR WrapperStruct00.var_1_13 [L120] EXPR WrapperStruct00.var_1_15 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) [L120] EXPR WrapperStruct00.var_1_20 [L120] EXPR WrapperStruct00.var_1_21 [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120-L121] return (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 22, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2719 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2685 mSDsluCounter, 11341 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8528 mSDsCounter, 733 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7852 IncrementalHoareTripleChecker+Invalid, 8585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 733 mSolverCounterUnsat, 2813 mSDtfsCounter, 7852 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1944 GetRequests, 1720 SyntacticMatches, 17 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=21, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 754 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 4259 NumberOfCodeBlocks, 4259 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4491 ConstructedInterpolants, 0 QuantifiedInterpolants, 11324 SizeOfPredicates, 18 NumberOfNonLiveVariables, 4507 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 33 InterpolantComputations, 18 PerfectInterpolantSequences, 17746/17952 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:59:00,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_wrapper-s_file-97.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:59:02,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:59:02,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:59:02,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:59:02,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:59:02,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:59:02,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:59:02,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:59:02,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:59:02,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:59:02,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:59:02,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:59:02,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:59:02,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:59:02,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:59:02,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:59:02,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:59:02,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:59:02,517 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2025-02-06 03:59:02,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:59:02,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:59:02,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:59:02,777 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:59:02,777 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:59:02,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2025-02-06 03:59:04,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f96779b39/d6749e8caec642eead30566c2e83fc8a/FLAG1b39f06a3 [2025-02-06 03:59:04,232 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:59:04,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2025-02-06 03:59:04,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f96779b39/d6749e8caec642eead30566c2e83fc8a/FLAG1b39f06a3 [2025-02-06 03:59:04,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f96779b39/d6749e8caec642eead30566c2e83fc8a [2025-02-06 03:59:04,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:59:04,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:59:04,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:59:04,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:59:04,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:59:04,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3508187b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04, skipping insertion in model container [2025-02-06 03:59:04,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:59:04,384 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_variablewrapping_wrapper-s_file-97.i[916,929] [2025-02-06 03:59:04,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:59:04,442 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:59:04,453 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_variablewrapping_wrapper-s_file-97.i[916,929] [2025-02-06 03:59:04,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:59:04,496 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:59:04,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04 WrapperNode [2025-02-06 03:59:04,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:59:04,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:59:04,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:59:04,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:59:04,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,547 INFO L138 Inliner]: procedures = 34, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 405 [2025-02-06 03:59:04,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:59:04,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:59:04,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:59:04,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:59:04,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,581 INFO L175 MemorySlicer]: Split 117 memory accesses to 2 slices as follows [2, 115]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-02-06 03:59:04,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:59:04,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:59:04,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:59:04,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:59:04,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (1/1) ... [2025-02-06 03:59:04,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:59:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:59:04,642 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-06 03:59:04,652 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-06 03:59:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:59:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:59:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 03:59:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:59:04,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:59:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 03:59:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 03:59:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:59:04,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:59:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:59:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:59:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:59:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:59:04,752 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:59:04,754 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:59:05,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: havoc property_#t~mem63#1;havoc property_#t~ite76#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite75#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite89#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite101#1;havoc property_#t~mem95#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short94#1;havoc property_#t~mem100#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short99#1;havoc property_#t~short102#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1; [2025-02-06 03:59:05,140 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-02-06 03:59:05,141 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:59:05,147 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:59:05,148 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:59:05,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:59:05 BoogieIcfgContainer [2025-02-06 03:59:05,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:59:05,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:59:05,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:59:05,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:59:05,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:59:04" (1/3) ... [2025-02-06 03:59:05,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f120b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:59:05, skipping insertion in model container [2025-02-06 03:59:05,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:59:04" (2/3) ... [2025-02-06 03:59:05,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f120b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:59:05, skipping insertion in model container [2025-02-06 03:59:05,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:59:05" (3/3) ... [2025-02-06 03:59:05,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2025-02-06 03:59:05,163 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:59:05,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-97.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:59:05,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:59:05,205 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;@30d828bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:59:05,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:59:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:59:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:59:05,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:05,215 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:05,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -866517080, now seen corresponding path program 1 times [2025-02-06 03:59:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:05,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405998410] [2025-02-06 03:59:05,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:05,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:05,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:59:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:59:05,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:59:05,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:05,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:05,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:59:05,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-02-06 03:59:05,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:05,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405998410] [2025-02-06 03:59:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405998410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:59:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163425867] [2025-02-06 03:59:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:05,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:59:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:05,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:59:05,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:59:05,518 INFO L87 Difference]: Start difference. First operand has 99 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:59:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:05,535 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-02-06 03:59:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:59:05,536 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-02-06 03:59:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:05,541 INFO L225 Difference]: With dead ends: 192 [2025-02-06 03:59:05,541 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:59:05,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-06 03:59:05,545 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:05,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:59:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:59:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 03:59:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:59:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-02-06 03:59:05,573 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 134 [2025-02-06 03:59:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:05,573 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-02-06 03:59:05,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:59:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-02-06 03:59:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:59:05,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:05,576 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:05,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:59:05,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:05,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash -793508585, now seen corresponding path program 1 times [2025-02-06 03:59:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:05,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932886144] [2025-02-06 03:59:05,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:05,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:05,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:05,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:05,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:59:05,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:59:05,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:59:05,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:05,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:05,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:59:05,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:06,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:06,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:06,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932886144] [2025-02-06 03:59:06,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932886144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:06,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:06,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:59:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138826141] [2025-02-06 03:59:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:06,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:59:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:59:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:59:06,043 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:06,083 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2025-02-06 03:59:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:59:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-02-06 03:59:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:06,088 INFO L225 Difference]: With dead ends: 191 [2025-02-06 03:59:06,088 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 03:59:06,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:59:06,089 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:06,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:59:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 03:59:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 03:59:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:59:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-02-06 03:59:06,100 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 134 [2025-02-06 03:59:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:06,104 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-02-06 03:59:06,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-02-06 03:59:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:59:06,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:06,106 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:06,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:59:06,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:06,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:06,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1175645681, now seen corresponding path program 1 times [2025-02-06 03:59:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146693180] [2025-02-06 03:59:06,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:06,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:06,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:06,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:06,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:59:06,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:59:06,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:59:06,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:06,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:06,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:59:06,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:06,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:06,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:06,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146693180] [2025-02-06 03:59:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146693180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:06,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:59:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625707935] [2025-02-06 03:59:06,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:06,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:59:06,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:06,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:59:06,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:59:06,564 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:07,048 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2025-02-06 03:59:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:59:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:59:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:07,050 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:59:07,050 INFO L226 Difference]: Without dead ends: 179 [2025-02-06 03:59:07,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 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-06 03:59:07,051 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 101 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:07,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 500 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:59:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-06 03:59:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 100. [2025-02-06 03:59:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:59:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-02-06 03:59:07,064 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 136 [2025-02-06 03:59:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:07,064 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-02-06 03:59:07,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-02-06 03:59:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:59:07,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:07,066 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:07,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:59:07,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:07,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 469186741, now seen corresponding path program 1 times [2025-02-06 03:59:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405145076] [2025-02-06 03:59:07,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:07,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:07,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:07,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:07,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:59:07,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:59:07,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:59:07,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:07,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:07,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:59:07,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:07,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:07,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:07,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405145076] [2025-02-06 03:59:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405145076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:07,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:07,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:59:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822333393] [2025-02-06 03:59:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:07,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:59:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:07,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:59:07,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:59:07,466 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:07,485 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2025-02-06 03:59:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:59:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:59:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:07,487 INFO L225 Difference]: With dead ends: 200 [2025-02-06 03:59:07,487 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 03:59:07,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:59:07,488 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:07,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:59:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 03:59:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-02-06 03:59:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:59:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-02-06 03:59:07,494 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 136 [2025-02-06 03:59:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:07,495 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-02-06 03:59:07,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-02-06 03:59:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:59:07,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:07,496 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:07,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:59:07,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:07,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1338267722, now seen corresponding path program 1 times [2025-02-06 03:59:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:07,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136838630] [2025-02-06 03:59:07,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:07,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:07,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:07,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:07,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:59:07,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:59:07,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:59:07,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:07,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:07,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:59:07,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:07,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:07,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:07,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136838630] [2025-02-06 03:59:07,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136838630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:07,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:07,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:59:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246281682] [2025-02-06 03:59:07,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:59:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:07,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:59:07,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:59:07,903 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:07,932 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2025-02-06 03:59:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:59:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:59:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:07,934 INFO L225 Difference]: With dead ends: 204 [2025-02-06 03:59:07,934 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 03:59:07,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:59:07,935 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:07,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:59:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 03:59:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-02-06 03:59:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:59:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-02-06 03:59:07,941 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 136 [2025-02-06 03:59:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:07,941 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-02-06 03:59:07,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-02-06 03:59:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:59:07,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:07,942 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:07,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:59:08,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:08,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:08,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -450764041, now seen corresponding path program 1 times [2025-02-06 03:59:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:08,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097755265] [2025-02-06 03:59:08,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:08,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:08,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:08,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:59:08,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:59:08,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:59:08,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:08,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:08,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:59:08,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:08,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:08,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097755265] [2025-02-06 03:59:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097755265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:08,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:59:08,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225518208] [2025-02-06 03:59:08,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:08,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:59:08,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:08,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:59:08,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:59:08,330 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:08,366 INFO L93 Difference]: Finished difference Result 208 states and 293 transitions. [2025-02-06 03:59:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:59:08,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-02-06 03:59:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:08,368 INFO L225 Difference]: With dead ends: 208 [2025-02-06 03:59:08,368 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 03:59:08,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:59:08,369 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:08,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:59:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 03:59:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-02-06 03:59:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 03:59:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2025-02-06 03:59:08,380 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 136 [2025-02-06 03:59:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:08,380 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2025-02-06 03:59:08,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2025-02-06 03:59:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:59:08,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:08,381 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:08,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:59:08,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:08,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:08,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash -449840520, now seen corresponding path program 1 times [2025-02-06 03:59:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:08,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443321737] [2025-02-06 03:59:08,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:08,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:08,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:08,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:59:08,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:59:08,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:59:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:08,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:59:08,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:08,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:59:09,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:59:09,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:09,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-06 03:59:09,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:09,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-06 03:59:09,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:09,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 74 [2025-02-06 03:59:09,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:09,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 90 [2025-02-06 03:59:09,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:09,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 120 [2025-02-06 03:59:09,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:09,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 46 [2025-02-06 03:59:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 30 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-02-06 03:59:09,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 03:59:10,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:10,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443321737] [2025-02-06 03:59:10,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443321737] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:59:10,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:59:10,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2025-02-06 03:59:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414758276] [2025-02-06 03:59:10,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:59:10,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 03:59:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:10,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 03:59:10,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:59:10,190 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 23 states, 19 states have (on average 4.473684210526316) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2025-02-06 03:59:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:14,641 INFO L93 Difference]: Finished difference Result 424 states and 576 transitions. [2025-02-06 03:59:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 03:59:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 4.473684210526316) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) Word has length 136 [2025-02-06 03:59:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:14,644 INFO L225 Difference]: With dead ends: 424 [2025-02-06 03:59:14,644 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 03:59:14,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=512, Invalid=2038, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 03:59:14,646 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 727 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:14,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1035 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-06 03:59:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 03:59:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 304. [2025-02-06 03:59:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 244 states have (on average 1.2745901639344261) internal successors, (311), 247 states have internal predecessors, (311), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:59:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 411 transitions. [2025-02-06 03:59:14,668 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 411 transitions. Word has length 136 [2025-02-06 03:59:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:14,668 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 411 transitions. [2025-02-06 03:59:14,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 4.473684210526316) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2025-02-06 03:59:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 411 transitions. [2025-02-06 03:59:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:59:14,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:14,669 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:14,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:59:14,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:14,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:14,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1147001356, now seen corresponding path program 1 times [2025-02-06 03:59:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:14,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522898900] [2025-02-06 03:59:14,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:14,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:14,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:14,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:14,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:59:14,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:59:15,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:59:15,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:15,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:15,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:59:15,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:15,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:59:15,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:59:15,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:15,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2025-02-06 03:59:15,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:15,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 65 [2025-02-06 03:59:15,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:15,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 82 [2025-02-06 03:59:15,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:15,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 112 [2025-02-06 03:59:15,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:15,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 113 treesize of output 47 [2025-02-06 03:59:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 238 proven. 18 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 03:59:15,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 03:59:16,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522898900] [2025-02-06 03:59:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522898900] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:59:16,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:59:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2025-02-06 03:59:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663281059] [2025-02-06 03:59:16,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:59:16,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 03:59:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:16,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 03:59:16,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:59:16,111 INFO L87 Difference]: Start difference. First operand 304 states and 411 transitions. Second operand has 23 states, 19 states have (on average 4.368421052631579) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 03:59:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:19,703 INFO L93 Difference]: Finished difference Result 834 states and 1098 transitions. [2025-02-06 03:59:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 03:59:19,707 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 4.368421052631579) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) Word has length 136 [2025-02-06 03:59:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:19,711 INFO L225 Difference]: With dead ends: 834 [2025-02-06 03:59:19,711 INFO L226 Difference]: Without dead ends: 554 [2025-02-06 03:59:19,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=512, Invalid=2038, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 03:59:19,713 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 400 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:19,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 961 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 03:59:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-06 03:59:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 254. [2025-02-06 03:59:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 201 states have (on average 1.2487562189054726) internal successors, (251), 203 states have internal predecessors, (251), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:59:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 331 transitions. [2025-02-06 03:59:19,734 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 331 transitions. Word has length 136 [2025-02-06 03:59:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:19,735 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 331 transitions. [2025-02-06 03:59:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 4.368421052631579) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 03:59:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 331 transitions. [2025-02-06 03:59:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 03:59:19,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:19,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:19,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:59:19,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:19,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:19,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:19,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1214008109, now seen corresponding path program 1 times [2025-02-06 03:59:19,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:19,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646461441] [2025-02-06 03:59:19,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:19,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:19,939 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:19,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:59:20,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 03:59:20,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 03:59:20,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:20,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:20,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:59:20,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:20,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:59:20,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:59:20,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:20,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2025-02-06 03:59:20,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:20,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2025-02-06 03:59:20,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 78 [2025-02-06 03:59:20,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:20,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 105 treesize of output 45 [2025-02-06 03:59:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 308 proven. 30 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-02-06 03:59:20,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 03:59:21,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646461441] [2025-02-06 03:59:21,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646461441] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:59:21,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:59:21,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 18 [2025-02-06 03:59:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444716754] [2025-02-06 03:59:21,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:59:21,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:59:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:21,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:59:21,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:59:21,048 INFO L87 Difference]: Start difference. First operand 254 states and 331 transitions. Second operand has 18 states, 14 states have (on average 5.857142857142857) internal successors, (82), 17 states have internal predecessors, (82), 8 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 5 states have call predecessors, (24), 8 states have call successors, (24) [2025-02-06 03:59:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:22,755 INFO L93 Difference]: Finished difference Result 440 states and 575 transitions. [2025-02-06 03:59:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:59:22,759 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 5.857142857142857) internal successors, (82), 17 states have internal predecessors, (82), 8 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 5 states have call predecessors, (24), 8 states have call successors, (24) Word has length 136 [2025-02-06 03:59:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:22,762 INFO L225 Difference]: With dead ends: 440 [2025-02-06 03:59:22,762 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 03:59:22,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:59:22,763 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 296 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:22,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 477 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:59:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 03:59:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2025-02-06 03:59:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 192 states have (on average 1.234375) internal successors, (237), 194 states have internal predecessors, (237), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:59:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 317 transitions. [2025-02-06 03:59:22,789 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 317 transitions. Word has length 136 [2025-02-06 03:59:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:22,789 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 317 transitions. [2025-02-06 03:59:22,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 5.857142857142857) internal successors, (82), 17 states have internal predecessors, (82), 8 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 5 states have call predecessors, (24), 8 states have call successors, (24) [2025-02-06 03:59:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 317 transitions. [2025-02-06 03:59:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:59:22,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:22,790 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:22,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-06 03:59:22,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:22,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:22,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1141579019, now seen corresponding path program 1 times [2025-02-06 03:59:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521475937] [2025-02-06 03:59:22,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:22,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:22,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:23,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:23,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:59:23,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:59:23,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:59:23,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:23,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:23,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:59:23,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:23,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:59:23,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-02-06 03:59:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:23,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:23,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:23,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521475937] [2025-02-06 03:59:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521475937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:59:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236011769] [2025-02-06 03:59:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:23,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:59:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:23,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:59:23,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:59:23,202 INFO L87 Difference]: Start difference. First operand 245 states and 317 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:23,615 INFO L93 Difference]: Finished difference Result 615 states and 803 transitions. [2025-02-06 03:59:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:59:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-02-06 03:59:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:23,620 INFO L225 Difference]: With dead ends: 615 [2025-02-06 03:59:23,620 INFO L226 Difference]: Without dead ends: 433 [2025-02-06 03:59:23,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:59:23,621 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:23,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 717 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:59:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-02-06 03:59:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 253. [2025-02-06 03:59:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 200 states have (on average 1.245) internal successors, (249), 202 states have internal predecessors, (249), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:59:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 329 transitions. [2025-02-06 03:59:23,653 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 329 transitions. Word has length 137 [2025-02-06 03:59:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 329 transitions. [2025-02-06 03:59:23,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2025-02-06 03:59:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:59:23,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:23,655 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:23,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 03:59:23,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:23,856 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:23,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash 435120079, now seen corresponding path program 1 times [2025-02-06 03:59:23,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:23,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725376868] [2025-02-06 03:59:23,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:23,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:23,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:23,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:59:23,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:59:24,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:59:24,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:24,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:24,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:59:24,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:24,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:59:24,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2025-02-06 03:59:24,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:24,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-02-06 03:59:24,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:24,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-02-06 03:59:24,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:24,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 68 [2025-02-06 03:59:24,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:24,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 84 [2025-02-06 03:59:24,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:24,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 114 [2025-02-06 03:59:25,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:25,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 111 treesize of output 117 [2025-02-06 03:59:25,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:25,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 106 treesize of output 40 [2025-02-06 03:59:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 294 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:59:25,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 03:59:25,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:25,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725376868] [2025-02-06 03:59:25,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725376868] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:59:25,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:59:25,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2025-02-06 03:59:25,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359915647] [2025-02-06 03:59:25,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:59:25,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 03:59:25,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:25,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 03:59:25,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:59:25,519 INFO L87 Difference]: Start difference. First operand 253 states and 329 transitions. Second operand has 25 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 7 states have call successors, (24) [2025-02-06 03:59:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:30,519 INFO L93 Difference]: Finished difference Result 642 states and 839 transitions. [2025-02-06 03:59:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-06 03:59:30,520 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 7 states have call successors, (24) Word has length 137 [2025-02-06 03:59:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:30,522 INFO L225 Difference]: With dead ends: 642 [2025-02-06 03:59:30,522 INFO L226 Difference]: Without dead ends: 452 [2025-02-06 03:59:30,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=623, Invalid=2239, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 03:59:30,523 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 591 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:30,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 897 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 03:59:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-06 03:59:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 273. [2025-02-06 03:59:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 220 states have (on average 1.2545454545454546) internal successors, (276), 222 states have internal predecessors, (276), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:59:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 356 transitions. [2025-02-06 03:59:30,558 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 356 transitions. Word has length 137 [2025-02-06 03:59:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:30,558 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 356 transitions. [2025-02-06 03:59:30,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 7 states have call successors, (24) [2025-02-06 03:59:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 356 transitions. [2025-02-06 03:59:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:59:30,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:30,559 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:30,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 03:59:30,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:30,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:30,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 297970643, now seen corresponding path program 1 times [2025-02-06 03:59:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:30,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259374210] [2025-02-06 03:59:30,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:30,764 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:30,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:59:30,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:59:30,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:59:30,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:30,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:30,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:59:30,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:31,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:59:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-02-06 03:59:31,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-02-06 03:59:31,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 20 [2025-02-06 03:59:31,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:59:31,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:31,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69 [2025-02-06 03:59:31,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:31,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 72 [2025-02-06 03:59:31,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:31,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 31 [2025-02-06 03:59:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 238 proven. 18 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 03:59:31,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 03:59:31,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259374210] [2025-02-06 03:59:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259374210] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:59:31,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:59:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2025-02-06 03:59:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323130204] [2025-02-06 03:59:31,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:59:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 03:59:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:31,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 03:59:31,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:59:31,636 INFO L87 Difference]: Start difference. First operand 273 states and 356 transitions. Second operand has 21 states, 17 states have (on average 5.117647058823529) internal successors, (87), 21 states have internal predecessors, (87), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 03:59:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:33,386 INFO L93 Difference]: Finished difference Result 666 states and 865 transitions. [2025-02-06 03:59:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-06 03:59:33,386 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 5.117647058823529) internal successors, (87), 21 states have internal predecessors, (87), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) Word has length 137 [2025-02-06 03:59:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:33,388 INFO L225 Difference]: With dead ends: 666 [2025-02-06 03:59:33,388 INFO L226 Difference]: Without dead ends: 456 [2025-02-06 03:59:33,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1653, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 03:59:33,389 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 419 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:33,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 847 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:59:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-02-06 03:59:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 405. [2025-02-06 03:59:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 331 states have (on average 1.2477341389728096) internal successors, (413), 335 states have internal predecessors, (413), 57 states have call successors, (57), 16 states have call predecessors, (57), 16 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-06 03:59:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 527 transitions. [2025-02-06 03:59:33,432 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 527 transitions. Word has length 137 [2025-02-06 03:59:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:33,432 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 527 transitions. [2025-02-06 03:59:33,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 5.117647058823529) internal successors, (87), 21 states have internal predecessors, (87), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 03:59:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 527 transitions. [2025-02-06 03:59:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:59:33,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:33,433 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:33,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:59:33,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:33,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:33,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1044002129, now seen corresponding path program 1 times [2025-02-06 03:59:33,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:33,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805951833] [2025-02-06 03:59:33,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:33,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:33,641 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:33,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:59:33,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:59:33,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:59:33,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:33,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:33,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:59:33,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:34,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 87 [2025-02-06 03:59:34,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:34,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 54 [2025-02-06 03:59:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 03:59:34,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:34,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805951833] [2025-02-06 03:59:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805951833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:34,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:59:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631023657] [2025-02-06 03:59:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:34,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:59:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:34,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:59:34,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:59:34,306 INFO L87 Difference]: Start difference. First operand 405 states and 527 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:59:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:35,754 INFO L93 Difference]: Finished difference Result 976 states and 1264 transitions. [2025-02-06 03:59:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:59:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2025-02-06 03:59:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:35,759 INFO L225 Difference]: With dead ends: 976 [2025-02-06 03:59:35,759 INFO L226 Difference]: Without dead ends: 601 [2025-02-06 03:59:35,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:59:35,760 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 242 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:35,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 359 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:59:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-06 03:59:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2025-02-06 03:59:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 491 states have (on average 1.2464358452138493) internal successors, (612), 498 states have internal predecessors, (612), 81 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 74 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-06 03:59:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 774 transitions. [2025-02-06 03:59:35,814 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 774 transitions. Word has length 138 [2025-02-06 03:59:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:35,814 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 774 transitions. [2025-02-06 03:59:35,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 03:59:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 774 transitions. [2025-02-06 03:59:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 03:59:35,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:35,817 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:35,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2025-02-06 03:59:36,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:36,018 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:36,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1087336909, now seen corresponding path program 1 times [2025-02-06 03:59:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:36,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834445936] [2025-02-06 03:59:36,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:36,022 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:36,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 03:59:36,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 03:59:36,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 03:59:36,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:36,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:36,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 03:59:36,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:36,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:59:36,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-02-06 03:59:36,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:36,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2025-02-06 03:59:36,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:36,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62 [2025-02-06 03:59:37,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:37,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 65 [2025-02-06 03:59:37,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:37,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 65 [2025-02-06 03:59:37,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:37,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 97 [2025-02-06 03:59:37,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 108 [2025-02-06 03:59:37,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:59:37,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:37,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 108 treesize of output 182 [2025-02-06 03:59:37,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 102 [2025-02-06 03:59:38,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:38,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 256 treesize of output 180 [2025-02-06 03:59:39,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:39,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 314 treesize of output 238 [2025-02-06 03:59:39,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:39,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 345 treesize of output 143 [2025-02-06 03:59:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-06 03:59:39,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:40,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834445936] [2025-02-06 03:59:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834445936] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:59:40,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:59:40,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [27] total 30 [2025-02-06 03:59:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730737399] [2025-02-06 03:59:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:40,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:59:40,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:40,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:59:40,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:59:40,047 INFO L87 Difference]: Start difference. First operand 598 states and 774 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:40,513 INFO L93 Difference]: Finished difference Result 1636 states and 2109 transitions. [2025-02-06 03:59:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:59:40,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-02-06 03:59:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:40,518 INFO L225 Difference]: With dead ends: 1636 [2025-02-06 03:59:40,519 INFO L226 Difference]: Without dead ends: 1068 [2025-02-06 03:59:40,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:59:40,520 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 100 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:40,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 552 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:59:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-02-06 03:59:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 598. [2025-02-06 03:59:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 491 states have (on average 1.234215885947047) internal successors, (606), 498 states have internal predecessors, (606), 81 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 74 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-06 03:59:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 768 transitions. [2025-02-06 03:59:40,584 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 768 transitions. Word has length 138 [2025-02-06 03:59:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:40,584 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 768 transitions. [2025-02-06 03:59:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 768 transitions. [2025-02-06 03:59:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:59:40,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:40,586 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:40,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:59:40,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:40,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:40,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1570516719, now seen corresponding path program 1 times [2025-02-06 03:59:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:40,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266039145] [2025-02-06 03:59:40,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:40,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:40,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:40,793 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:40,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:59:40,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:59:41,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:59:41,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:41,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:41,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:59:41,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:41,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:59:41,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-02-06 03:59:41,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-02-06 03:59:41,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:41,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2025-02-06 03:59:41,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:41,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2025-02-06 03:59:41,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:41,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 69 [2025-02-06 03:59:41,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 87 [2025-02-06 03:59:41,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:59:41,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:41,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 145 [2025-02-06 03:59:41,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 54 [2025-02-06 03:59:41,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:41,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 202 treesize of output 153 [2025-02-06 03:59:42,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:42,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 164 [2025-02-06 03:59:42,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:42,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 253 treesize of output 109 [2025-02-06 03:59:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 362 proven. 42 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-06 03:59:42,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:42,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266039145] [2025-02-06 03:59:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266039145] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:59:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:59:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2025-02-06 03:59:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368311586] [2025-02-06 03:59:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:59:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:42,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:59:42,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:59:42,821 INFO L87 Difference]: Start difference. First operand 598 states and 768 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:43,215 INFO L93 Difference]: Finished difference Result 1606 states and 2055 transitions. [2025-02-06 03:59:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:59:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:59:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:43,220 INFO L225 Difference]: With dead ends: 1606 [2025-02-06 03:59:43,220 INFO L226 Difference]: Without dead ends: 1038 [2025-02-06 03:59:43,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:59:43,221 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 162 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:43,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 264 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:59:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-02-06 03:59:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 598. [2025-02-06 03:59:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 491 states have (on average 1.2219959266802445) internal successors, (600), 498 states have internal predecessors, (600), 81 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 74 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-06 03:59:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 762 transitions. [2025-02-06 03:59:43,281 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 762 transitions. Word has length 139 [2025-02-06 03:59:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:43,282 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 762 transitions. [2025-02-06 03:59:43,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 762 transitions. [2025-02-06 03:59:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:59:43,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:43,283 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:43,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:59:43,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:43,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:43,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash -786179219, now seen corresponding path program 1 times [2025-02-06 03:59:43,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:43,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213730583] [2025-02-06 03:59:43,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:43,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:43,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:43,490 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:43,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-02-06 03:59:43,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:59:43,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:59:43,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:43,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:43,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 03:59:43,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:43,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:59:43,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-02-06 03:59:44,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:44,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 39 [2025-02-06 03:59:44,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:44,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2025-02-06 03:59:44,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:44,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62 [2025-02-06 03:59:44,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:44,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 65 [2025-02-06 03:59:44,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:44,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 88 [2025-02-06 03:59:44,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 105 [2025-02-06 03:59:44,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:59:44,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:44,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 105 treesize of output 169 [2025-02-06 03:59:44,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 77 [2025-02-06 03:59:45,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:45,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 246 treesize of output 173 [2025-02-06 03:59:45,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:45,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 277 treesize of output 184 [2025-02-06 03:59:46,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:46,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 351 treesize of output 159 [2025-02-06 03:59:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 374 proven. 84 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-06 03:59:46,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:46,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213730583] [2025-02-06 03:59:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213730583] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:59:46,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:59:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [28] total 32 [2025-02-06 03:59:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553560786] [2025-02-06 03:59:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:46,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:59:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:46,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:59:46,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:59:46,826 INFO L87 Difference]: Start difference. First operand 598 states and 762 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:47,742 INFO L93 Difference]: Finished difference Result 1180 states and 1500 transitions. [2025-02-06 03:59:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:59:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-02-06 03:59:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:47,745 INFO L225 Difference]: With dead ends: 1180 [2025-02-06 03:59:47,745 INFO L226 Difference]: Without dead ends: 612 [2025-02-06 03:59:47,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:59:47,746 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:47,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 638 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:59:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-06 03:59:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 607. [2025-02-06 03:59:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 500 states have (on average 1.218) internal successors, (609), 507 states have internal predecessors, (609), 81 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 74 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-06 03:59:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 771 transitions. [2025-02-06 03:59:47,798 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 771 transitions. Word has length 139 [2025-02-06 03:59:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 771 transitions. [2025-02-06 03:59:47,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 771 transitions. [2025-02-06 03:59:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:59:47,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:47,799 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:47,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-02-06 03:59:48,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:48,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:48,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash 794012239, now seen corresponding path program 1 times [2025-02-06 03:59:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029296528] [2025-02-06 03:59:48,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:48,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:48,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:48,006 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:48,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-02-06 03:59:48,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:59:48,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:59:48,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:48,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:48,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 03:59:48,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:48,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:59:48,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2025-02-06 03:59:48,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:48,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 52 [2025-02-06 03:59:49,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:49,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 65 [2025-02-06 03:59:49,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:49,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 73 [2025-02-06 03:59:49,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:49,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2025-02-06 03:59:49,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2025-02-06 03:59:50,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:50,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2025-02-06 03:59:50,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:50,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 111 [2025-02-06 03:59:50,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 104 [2025-02-06 03:59:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 03:59:50,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:50,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 104 treesize of output 206 [2025-02-06 03:59:50,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 85 [2025-02-06 03:59:51,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:51,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 291 treesize of output 242 [2025-02-06 03:59:52,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:52,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 330 treesize of output 266 [2025-02-06 03:59:53,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:59:53,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 418 treesize of output 202 [2025-02-06 03:59:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 386 proven. 102 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 03:59:53,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:59:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:53,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029296528] [2025-02-06 03:59:53,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029296528] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:59:53,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:59:53,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [29] total 33 [2025-02-06 03:59:53,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114635296] [2025-02-06 03:59:53,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:53,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:59:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:53,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:59:53,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:59:53,621 INFO L87 Difference]: Start difference. First operand 607 states and 771 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:54,004 INFO L93 Difference]: Finished difference Result 1459 states and 1860 transitions. [2025-02-06 03:59:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:59:54,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-02-06 03:59:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:54,008 INFO L225 Difference]: With dead ends: 1459 [2025-02-06 03:59:54,008 INFO L226 Difference]: Without dead ends: 882 [2025-02-06 03:59:54,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:59:54,009 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 48 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:54,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 769 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:59:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-02-06 03:59:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 637. [2025-02-06 03:59:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 530 states have (on average 1.2169811320754718) internal successors, (645), 537 states have internal predecessors, (645), 81 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 74 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-06 03:59:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 807 transitions. [2025-02-06 03:59:54,076 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 807 transitions. Word has length 140 [2025-02-06 03:59:54,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:54,076 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 807 transitions. [2025-02-06 03:59:54,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 807 transitions. [2025-02-06 03:59:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:59:54,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:54,077 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:54,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-02-06 03:59:54,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:54,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:54,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2147321936, now seen corresponding path program 1 times [2025-02-06 03:59:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:54,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242381374] [2025-02-06 03:59:54,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:54,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:54,281 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:54,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-06 03:59:54,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:59:54,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:59:54,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:54,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:54,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:59:54,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:54,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 03:59:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:54,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:54,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242381374] [2025-02-06 03:59:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242381374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:54,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:59:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227219452] [2025-02-06 03:59:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:54,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:59:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:54,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:59:54,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:59:54,611 INFO L87 Difference]: Start difference. First operand 637 states and 807 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:59:56,188 INFO L93 Difference]: Finished difference Result 1244 states and 1574 transitions. [2025-02-06 03:59:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:59:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-02-06 03:59:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:59:56,192 INFO L225 Difference]: With dead ends: 1244 [2025-02-06 03:59:56,192 INFO L226 Difference]: Without dead ends: 637 [2025-02-06 03:59:56,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:59:56,194 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 106 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:59:56,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 220 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:59:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-06 03:59:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2025-02-06 03:59:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 530 states have (on average 1.1943396226415095) internal successors, (633), 537 states have internal predecessors, (633), 81 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 74 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-06 03:59:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 795 transitions. [2025-02-06 03:59:56,257 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 795 transitions. Word has length 140 [2025-02-06 03:59:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:59:56,257 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 795 transitions. [2025-02-06 03:59:56,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 03:59:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 795 transitions. [2025-02-06 03:59:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:59:56,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:59:56,259 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 03:59:56,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-02-06 03:59:56,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:56,463 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:59:56,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:59:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1005363152, now seen corresponding path program 1 times [2025-02-06 03:59:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:59:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404418790] [2025-02-06 03:59:56,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:59:56,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:59:56,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:59:56,467 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:59:56,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-06 03:59:56,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:59:56,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:59:56,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:59:56,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:59:56,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:59:56,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:59:56,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 03:59:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 03:59:56,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:59:56,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:59:56,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404418790] [2025-02-06 03:59:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404418790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:59:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:59:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:59:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448320134] [2025-02-06 03:59:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:59:56,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:59:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:59:56,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:59:56,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:59:56,674 INFO L87 Difference]: Start difference. First operand 637 states and 795 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)