./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:08:52,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:08:52,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:08:52,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:08:52,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:08:52,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:08:52,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:08:52,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:08:52,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:08:52,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:08:52,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:08:52,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:08:52,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:08:52,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:08:52,581 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:08:52,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:08:52,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:08:52,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:08:52,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:08:52,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:08:52,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:08:52,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:08:52,584 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 -> a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a [2025-02-06 04:08:52,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:08:52,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:08:52,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:08:52,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:08:52,809 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:08:52,810 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-sp_file-83.i [2025-02-06 04:08:53,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b47e3ad4d/fa77127ec32149dc88e9ea6f2eb5d463/FLAG7779c4700 [2025-02-06 04:08:54,171 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:08:54,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2025-02-06 04:08:54,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b47e3ad4d/fa77127ec32149dc88e9ea6f2eb5d463/FLAG7779c4700 [2025-02-06 04:08:54,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b47e3ad4d/fa77127ec32149dc88e9ea6f2eb5d463 [2025-02-06 04:08:54,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:08:54,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:08:54,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:08:54,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:08:54,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:08:54,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54, skipping insertion in model container [2025-02-06 04:08:54,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:08:54,651 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-sp_file-83.i[917,930] [2025-02-06 04:08:54,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:08:54,737 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:08:54,745 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-sp_file-83.i[917,930] [2025-02-06 04:08:54,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:08:54,803 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:08:54,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54 WrapperNode [2025-02-06 04:08:54,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:08:54,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:08:54,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:08:54,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:08:54,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,850 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-02-06 04:08:54,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:08:54,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:08:54,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:08:54,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:08:54,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,868 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:08:54,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:08:54,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:08:54,889 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:08:54,889 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:08:54,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (1/1) ... [2025-02-06 04:08:54,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:08:54,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:08:54,919 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 04:08:54,921 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 04:08:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:08:54,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:08:54,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:08:54,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:08:54,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:08:55,041 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:08:55,043 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:08:55,411 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem78#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite91#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite122#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~bitwise109#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite132#1;havoc property_#t~mem131#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-02-06 04:08:55,448 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-02-06 04:08:55,449 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:08:55,462 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:08:55,462 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:08:55,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:08:55 BoogieIcfgContainer [2025-02-06 04:08:55,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:08:55,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:08:55,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:08:55,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:08:55,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:08:54" (1/3) ... [2025-02-06 04:08:55,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea5b69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:08:55, skipping insertion in model container [2025-02-06 04:08:55,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:08:54" (2/3) ... [2025-02-06 04:08:55,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea5b69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:08:55, skipping insertion in model container [2025-02-06 04:08:55,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:08:55" (3/3) ... [2025-02-06 04:08:55,472 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-83.i [2025-02-06 04:08:55,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:08:55,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-83.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:08:55,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:08:55,528 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;@423d4125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:08:55,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:08:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:08:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 04:08:55,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:55,538 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:55,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:55,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2129860447, now seen corresponding path program 1 times [2025-02-06 04:08:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:08:55,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-02-06 04:08:55,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:08:55,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:08:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:08:55,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 04:08:55,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:08:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227614896] [2025-02-06 04:08:55,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227614896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:08:55,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222362268] [2025-02-06 04:08:55,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:55,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:08:55,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:08:55,843 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 04:08:55,844 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 04:08:55,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:08:56,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:08:56,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:56,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:56,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:08:56,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:08:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 04:08:56,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:08:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222362268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:56,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:08:56,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:08:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029081515] [2025-02-06 04:08:56,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:56,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:08:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:08:56,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:08:56,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:08:56,086 INFO L87 Difference]: Start difference. First operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 04:08:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:56,108 INFO L93 Difference]: Finished difference Result 216 states and 334 transitions. [2025-02-06 04:08:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:08:56,109 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-02-06 04:08:56,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:56,113 INFO L225 Difference]: With dead ends: 216 [2025-02-06 04:08:56,114 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 04:08:56,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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 04:08:56,118 INFO L435 NwaCegarLoop]: 151 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, 151 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 04:08:56,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:08:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 04:08:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 04:08:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:08:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-02-06 04:08:56,154 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 106 [2025-02-06 04:08:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:56,155 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-02-06 04:08:56,155 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 04:08:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-02-06 04:08:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 04:08:56,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:56,159 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:56,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:08:56,360 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 04:08:56,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:56,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -392751350, now seen corresponding path program 1 times [2025-02-06 04:08:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:08:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49134817] [2025-02-06 04:08:56,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:08:56,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:08:56,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:08:56,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:56,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:08:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:08:56,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49134817] [2025-02-06 04:08:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49134817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:08:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:08:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976498110] [2025-02-06 04:08:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:56,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:08:56,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:08:56,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:08:56,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:08:56,677 INFO L87 Difference]: Start difference. First operand 108 states and 153 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:56,712 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2025-02-06 04:08:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:08:56,713 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 04:08:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:56,715 INFO L225 Difference]: With dead ends: 216 [2025-02-06 04:08:56,716 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 04:08:56,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:08:56,717 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 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 04:08:56,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:08:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 04:08:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-02-06 04:08:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:08:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2025-02-06 04:08:56,727 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2025-02-06 04:08:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:56,730 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2025-02-06 04:08:56,730 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2025-02-06 04:08:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 04:08:56,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:56,733 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:08:56,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2094761483, now seen corresponding path program 1 times [2025-02-06 04:08:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:08:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278294450] [2025-02-06 04:08:56,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:08:56,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:08:56,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:08:56,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:56,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:08:56,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:08:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278294450] [2025-02-06 04:08:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278294450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:08:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:08:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468600098] [2025-02-06 04:08:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:56,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:08:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:08:56,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:08:56,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:08:56,895 INFO L87 Difference]: Start difference. First operand 110 states and 155 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:56,929 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2025-02-06 04:08:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:08:56,929 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 04:08:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:56,931 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:08:56,933 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 04:08:56,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:08:56,934 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 434 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 04:08:56,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 434 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:08:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 04:08:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-06 04:08:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:08:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-02-06 04:08:56,945 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2025-02-06 04:08:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:56,946 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-02-06 04:08:56,946 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-02-06 04:08:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 04:08:56,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:56,947 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:56,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:08:56,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1312702132, now seen corresponding path program 1 times [2025-02-06 04:08:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:08:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936202662] [2025-02-06 04:08:56,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:08:56,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:08:56,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:08:56,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:56,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:08:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:08:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936202662] [2025-02-06 04:08:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936202662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:57,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:08:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:08:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289943326] [2025-02-06 04:08:57,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:57,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:08:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:08:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:08:57,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:08:57,084 INFO L87 Difference]: Start difference. First operand 112 states and 157 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:57,111 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2025-02-06 04:08:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:08:57,112 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-02-06 04:08:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:57,114 INFO L225 Difference]: With dead ends: 224 [2025-02-06 04:08:57,114 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 04:08:57,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:08:57,116 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 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 04:08:57,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:08:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 04:08:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-02-06 04:08:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:08:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-02-06 04:08:57,125 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 106 [2025-02-06 04:08:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:57,125 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-02-06 04:08:57,125 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-02-06 04:08:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 04:08:57,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:57,126 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:08:57,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:57,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1311778611, now seen corresponding path program 1 times [2025-02-06 04:08:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:08:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754009533] [2025-02-06 04:08:57,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:08:57,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:08:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:08:57,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:57,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:08:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:08:57,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754009533] [2025-02-06 04:08:57,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754009533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:57,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:08:57,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:08:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013450850] [2025-02-06 04:08:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:57,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:08:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:08:57,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:08:57,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:08:57,920 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 04:08:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:58,164 INFO L93 Difference]: Finished difference Result 225 states and 315 transitions. [2025-02-06 04:08:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:08:58,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-02-06 04:08:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:58,166 INFO L225 Difference]: With dead ends: 225 [2025-02-06 04:08:58,166 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 04:08:58,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:08:58,167 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 275 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:08:58,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 255 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:08:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 04:08:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 04:08:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:08:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-02-06 04:08:58,175 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 106 [2025-02-06 04:08:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:58,175 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-02-06 04:08:58,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 04:08:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-02-06 04:08:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 04:08:58,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:58,177 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:58,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:08:58,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:58,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1186289467, now seen corresponding path program 1 times [2025-02-06 04:08:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:08:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484685806] [2025-02-06 04:08:58,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:08:58,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 04:08:58,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 04:08:58,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:58,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:08:58,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:08:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484685806] [2025-02-06 04:08:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484685806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:58,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:08:58,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:08:58,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104592076] [2025-02-06 04:08:58,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:58,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:08:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:08:58,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:08:58,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:08:58,355 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:58,515 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2025-02-06 04:08:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:08:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-02-06 04:08:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:58,516 INFO L225 Difference]: With dead ends: 227 [2025-02-06 04:08:58,516 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 04:08:58,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:08:58,517 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:08:58,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 477 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:08:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 04:08:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 04:08:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:08:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2025-02-06 04:08:58,530 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 107 [2025-02-06 04:08:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:58,531 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2025-02-06 04:08:58,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:08:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2025-02-06 04:08:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:08:58,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:58,532 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:08:58,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:08:58,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:58,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash 398181896, now seen corresponding path program 1 times [2025-02-06 04:08:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:08:58,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083890713] [2025-02-06 04:08:58,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:08:58,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:08:58,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:08:58,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:58,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:09:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:00,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083890713] [2025-02-06 04:09:00,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083890713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:00,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:00,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:09:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118174631] [2025-02-06 04:09:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:00,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:09:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:00,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:09:00,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:09:00,638 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 04:09:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:01,416 INFO L93 Difference]: Finished difference Result 298 states and 411 transitions. [2025-02-06 04:09:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:09:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2025-02-06 04:09:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:01,417 INFO L225 Difference]: With dead ends: 298 [2025-02-06 04:09:01,417 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 04:09:01,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:09:01,418 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 282 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:01,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 620 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:09:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 04:09:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2025-02-06 04:09:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 124 states have internal predecessors, (168), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 04:09:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2025-02-06 04:09:01,428 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 108 [2025-02-06 04:09:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:01,428 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2025-02-06 04:09:01,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 04:09:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2025-02-06 04:09:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:09:01,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:01,429 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:01,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:09:01,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:01,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -112352281, now seen corresponding path program 1 times [2025-02-06 04:09:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785854736] [2025-02-06 04:09:01,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:01,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:01,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:01,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:01,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:09:01,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703480142] [2025-02-06 04:09:01,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:01,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:01,555 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 04:09:01,557 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 04:09:01,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:01,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:01,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:01,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:01,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 04:09:01,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:09:01,831 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 43 treesize of output 42 [2025-02-06 04:09:02,076 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 74 treesize of output 58 [2025-02-06 04:09:02,684 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 15 treesize of output 1 [2025-02-06 04:09:03,255 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 15 treesize of output 1 [2025-02-06 04:09:04,164 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 26 treesize of output 14 [2025-02-06 04:09:04,588 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 26 treesize of output 14 [2025-02-06 04:09:04,936 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 26 treesize of output 14 [2025-02-06 04:09:05,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:05,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:05,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:05,529 INFO L349 Elim1Store]: treesize reduction 266, result has 26.3 percent of original size [2025-02-06 04:09:05,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 75 treesize of output 169 [2025-02-06 04:09:05,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:05,843 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:09:05,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-02-06 04:09:05,902 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-02-06 04:09:05,902 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 5 case distinctions, treesize of input 141 treesize of output 151 [2025-02-06 04:09:06,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,456 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 04:09:06,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-02-06 04:09:06,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,560 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 04:09:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-02-06 04:09:06,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,750 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2025-02-06 04:09:06,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 73 [2025-02-06 04:09:06,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:06,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,013 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 04:09:07,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-02-06 04:09:07,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,116 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 04:09:07,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-02-06 04:09:07,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:09:07,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2025-02-06 04:09:07,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,557 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-02-06 04:09:07,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 43 [2025-02-06 04:09:07,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:07,681 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-06 04:09:07,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 31 [2025-02-06 04:09:11,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,134 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 28 treesize of output 23 [2025-02-06 04:09:11,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2025-02-06 04:09:11,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:11,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-02-06 04:09:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-06 04:09:11,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:09:16,088 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int)) (v_ArrVal_829 Int) (~WrapperStruct00_var_1_16_Pointer~0.base Int) (~WrapperStruct00_var_1_16_Pointer~0.offset Int) (v_ArrVal_835 Int)) (let ((.cse0 (let ((.cse2 (store (store (store |c_#memory_int| c_~WrapperStruct00_var_1_14_Pointer~0.base v_ArrVal_832) c_~WrapperStruct00_var_1_15_Pointer~0.base v_ArrVal_831) c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset 200)))) (store .cse3 c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset (select (select .cse3 ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset)))) c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_829)))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (mod (select (select .cse2 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256)))))) (or (not (= (select (select .cse0 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 0)) (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_835)))) (< (* (select (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) (mod c_~last_1_WrapperStruct00_var_1_1~0 65536)) (+ (div (mod (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 65536) (mod (select (select .cse1 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 256)) 1)))))) is different from false [2025-02-06 04:09:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785854736] [2025-02-06 04:09:16,153 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 04:09:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703480142] [2025-02-06 04:09:16,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703480142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:09:16,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:09:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-02-06 04:09:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513075775] [2025-02-06 04:09:16,153 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 04:09:16,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:09:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:16,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:09:16,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=430, Unknown=2, NotChecked=42, Total=552 [2025-02-06 04:09:16,154 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 04:09:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:17,920 INFO L93 Difference]: Finished difference Result 570 states and 782 transitions. [2025-02-06 04:09:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:09:17,921 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2025-02-06 04:09:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:17,922 INFO L225 Difference]: With dead ends: 570 [2025-02-06 04:09:17,922 INFO L226 Difference]: Without dead ends: 436 [2025-02-06 04:09:17,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=207, Invalid=917, Unknown=2, NotChecked=64, Total=1190 [2025-02-06 04:09:17,923 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1020 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:17,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 879 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 04:09:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-06 04:09:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 197. [2025-02-06 04:09:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 171 states have (on average 1.345029239766082) internal successors, (230), 171 states have internal predecessors, (230), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 04:09:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 274 transitions. [2025-02-06 04:09:17,954 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 274 transitions. Word has length 108 [2025-02-06 04:09:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:17,954 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 274 transitions. [2025-02-06 04:09:17,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 04:09:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 274 transitions. [2025-02-06 04:09:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:09:17,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:17,955 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:17,963 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 04:09:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:18,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1240957416, now seen corresponding path program 1 times [2025-02-06 04:09:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307092479] [2025-02-06 04:09:18,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:18,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:18,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:18,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:18,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:09:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046137743] [2025-02-06 04:09:18,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:18,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:18,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:18,213 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 04:09:18,214 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 04:09:18,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:18,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:18,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:18,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:18,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 04:09:18,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:09:18,474 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 71 treesize of output 70 [2025-02-06 04:09:18,841 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 120 treesize of output 100 [2025-02-06 04:09:19,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:19,310 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2025-02-06 04:09:19,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2025-02-06 04:09:19,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:09:19,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 04:09:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:09:19,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:09:19,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:19,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307092479] [2025-02-06 04:09:19,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 04:09:19,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046137743] [2025-02-06 04:09:19,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046137743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:19,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:19,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:09:19,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773658386] [2025-02-06 04:09:19,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:19,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:09:19,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:19,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:09:19,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:09:19,397 INFO L87 Difference]: Start difference. First operand 197 states and 274 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:09:25,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:09:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:26,926 INFO L93 Difference]: Finished difference Result 455 states and 633 transitions. [2025-02-06 04:09:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:09:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-02-06 04:09:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:26,928 INFO L225 Difference]: With dead ends: 455 [2025-02-06 04:09:26,928 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 04:09:26,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:09:26,928 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 182 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:26,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 645 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-02-06 04:09:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 04:09:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 208. [2025-02-06 04:09:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 181 states have internal predecessors, (241), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 04:09:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 285 transitions. [2025-02-06 04:09:26,950 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 285 transitions. Word has length 108 [2025-02-06 04:09:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:26,950 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 285 transitions. [2025-02-06 04:09:26,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:09:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 285 transitions. [2025-02-06 04:09:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:09:26,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:26,951 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:26,958 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 04:09:27,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:27,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:27,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash 598899017, now seen corresponding path program 1 times [2025-02-06 04:09:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599477886] [2025-02-06 04:09:27,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:27,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:27,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:27,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:27,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:09:27,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:27,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599477886] [2025-02-06 04:09:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599477886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:27,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:27,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:09:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327429231] [2025-02-06 04:09:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:09:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:27,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:09:27,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:09:27,995 INFO L87 Difference]: Start difference. First operand 208 states and 285 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 04:09:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:28,588 INFO L93 Difference]: Finished difference Result 346 states and 475 transitions. [2025-02-06 04:09:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:09:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-02-06 04:09:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:28,590 INFO L225 Difference]: With dead ends: 346 [2025-02-06 04:09:28,590 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 04:09:28,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:09:28,591 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 182 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:28,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 414 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:09:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 04:09:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-02-06 04:09:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.315217391304348) internal successors, (242), 184 states have internal predecessors, (242), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 04:09:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2025-02-06 04:09:28,611 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 108 [2025-02-06 04:09:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:28,611 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2025-02-06 04:09:28,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 04:09:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2025-02-06 04:09:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:09:28,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:28,612 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:09:28,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1934059113, now seen corresponding path program 1 times [2025-02-06 04:09:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147907198] [2025-02-06 04:09:28,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:28,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:28,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:28,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:09:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147907198] [2025-02-06 04:09:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147907198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:54,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:54,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:09:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703510152] [2025-02-06 04:09:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:54,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:09:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:54,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:09:54,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:09:54,455 INFO L87 Difference]: Start difference. First operand 212 states and 286 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-06 04:09:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:56,145 INFO L93 Difference]: Finished difference Result 437 states and 592 transitions. [2025-02-06 04:09:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:09:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) Word has length 108 [2025-02-06 04:09:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:56,148 INFO L225 Difference]: With dead ends: 437 [2025-02-06 04:09:56,148 INFO L226 Difference]: Without dead ends: 299 [2025-02-06 04:09:56,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:09:56,149 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 571 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:56,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 814 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 04:09:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-06 04:09:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 230. [2025-02-06 04:09:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 202 states have (on average 1.3267326732673268) internal successors, (268), 202 states have internal predecessors, (268), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 04:09:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 312 transitions. [2025-02-06 04:09:56,174 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 312 transitions. Word has length 108 [2025-02-06 04:09:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:56,175 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 312 transitions. [2025-02-06 04:09:56,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-06 04:09:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 312 transitions. [2025-02-06 04:09:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:09:56,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:56,177 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:09:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:09:56,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:56,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 836547048, now seen corresponding path program 1 times [2025-02-06 04:09:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113508635] [2025-02-06 04:09:56,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:56,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:56,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:56,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:56,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:09:56,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764856435] [2025-02-06 04:09:56,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:56,235 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 04:09:56,237 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 04:09:56,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:09:56,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:09:56,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:56,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:56,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-06 04:09:56,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:09:57,494 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 15 treesize of output 1 [2025-02-06 04:09:58,048 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 15 treesize of output 1 [2025-02-06 04:09:58,301 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 15 treesize of output 1 [2025-02-06 04:09:58,535 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 15 treesize of output 1 [2025-02-06 04:09:58,975 INFO L349 Elim1Store]: treesize reduction 254, result has 27.2 percent of original size [2025-02-06 04:09:58,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 149 [2025-02-06 04:09:59,209 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 34 treesize of output 22 [2025-02-06 04:09:59,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:09:59,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 04:09:59,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:09:59,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 23 [2025-02-06 04:09:59,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:09:59,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 23 [2025-02-06 04:09:59,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:09:59,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 23 [2025-02-06 04:09:59,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:09:59,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 23 [2025-02-06 04:09:59,497 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 04:09:59,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 34 [2025-02-06 04:09:59,525 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-02-06 04:09:59,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-02-06 04:09:59,545 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:09:59,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2025-02-06 04:09:59,651 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:09:59,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2025-02-06 04:09:59,715 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 04:09:59,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2025-02-06 04:09:59,742 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:09:59,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-02-06 04:10:00,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-02-06 04:10:00,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:00,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2025-02-06 04:10:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-06 04:10:00,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113508635] [2025-02-06 04:10:09,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 04:10:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764856435] [2025-02-06 04:10:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764856435] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:09,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-02-06 04:10:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459620097] [2025-02-06 04:10:09,670 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 04:10:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:10:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:09,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:10:09,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=346, Unknown=2, NotChecked=0, Total=420 [2025-02-06 04:10:09,671 INFO L87 Difference]: Start difference. First operand 230 states and 312 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 04:10:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:11,355 INFO L93 Difference]: Finished difference Result 526 states and 717 transitions. [2025-02-06 04:10:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:10:11,355 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-02-06 04:10:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:11,357 INFO L225 Difference]: With dead ends: 526 [2025-02-06 04:10:11,357 INFO L226 Difference]: Without dead ends: 369 [2025-02-06 04:10:11,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=164, Invalid=590, Unknown=2, NotChecked=0, Total=756 [2025-02-06 04:10:11,358 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 569 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:11,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 722 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 04:10:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-06 04:10:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 244. [2025-02-06 04:10:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 216 states have internal predecessors, (288), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 04:10:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 332 transitions. [2025-02-06 04:10:11,384 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 332 transitions. Word has length 108 [2025-02-06 04:10:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:11,384 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 332 transitions. [2025-02-06 04:10:11,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 04:10:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 332 transitions. [2025-02-06 04:10:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:10:11,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:11,385 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:11,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:11,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 04:10:11,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 326012871, now seen corresponding path program 1 times [2025-02-06 04:10:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576921017] [2025-02-06 04:10:11,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:11,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:10:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:10:11,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:11,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:10:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:12,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576921017] [2025-02-06 04:10:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576921017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:12,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:10:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662451768] [2025-02-06 04:10:12,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:10:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:12,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:10:12,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:12,026 INFO L87 Difference]: Start difference. First operand 244 states and 332 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:10:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:12,388 INFO L93 Difference]: Finished difference Result 484 states and 660 transitions. [2025-02-06 04:10:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:10:12,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-02-06 04:10:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:12,390 INFO L225 Difference]: With dead ends: 484 [2025-02-06 04:10:12,390 INFO L226 Difference]: Without dead ends: 313 [2025-02-06 04:10:12,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:12,391 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 284 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:12,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 726 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-06 04:10:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 262. [2025-02-06 04:10:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 234 states have (on average 1.3418803418803418) internal successors, (314), 234 states have internal predecessors, (314), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 04:10:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2025-02-06 04:10:12,424 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 108 [2025-02-06 04:10:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:12,424 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2025-02-06 04:10:12,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 04:10:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2025-02-06 04:10:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 04:10:12,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:12,425 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:12,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:10:12,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:12,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2105110551, now seen corresponding path program 1 times [2025-02-06 04:10:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237297152] [2025-02-06 04:10:12,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:12,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 04:10:12,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 04:10:12,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:10:14,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:14,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237297152] [2025-02-06 04:10:14,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237297152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:14,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:14,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:10:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298060492] [2025-02-06 04:10:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:14,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:10:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:14,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:10:14,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:10:14,675 INFO L87 Difference]: Start difference. First operand 262 states and 358 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-06 04:10:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:16,076 INFO L93 Difference]: Finished difference Result 518 states and 710 transitions. [2025-02-06 04:10:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:10:16,077 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) Word has length 108 [2025-02-06 04:10:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:16,078 INFO L225 Difference]: With dead ends: 518 [2025-02-06 04:10:16,078 INFO L226 Difference]: Without dead ends: 329 [2025-02-06 04:10:16,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:10:16,078 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 396 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:16,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 893 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:10:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-06 04:10:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 274. [2025-02-06 04:10:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 246 states have internal predecessors, (332), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 04:10:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2025-02-06 04:10:16,107 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 108 [2025-02-06 04:10:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:16,107 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2025-02-06 04:10:16,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-06 04:10:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2025-02-06 04:10:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 04:10:16,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:16,108 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:10:16,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:10:16,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:16,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash 233092248, now seen corresponding path program 1 times [2025-02-06 04:10:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302959802] [2025-02-06 04:10:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:16,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 04:10:16,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 04:10:16,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:16,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:10:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105681957] [2025-02-06 04:10:16,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:16,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:16,170 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 04:10:16,172 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 04:10:16,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 04:10:16,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 04:10:16,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:16,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:16,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-06 04:10:16,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:18,759 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 15 treesize of output 1 [2025-02-06 04:10:19,137 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 28 treesize of output 23 [2025-02-06 04:10:19,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2025-02-06 04:10:19,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:19,369 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-02-06 04:10:19,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 68 [2025-02-06 04:10:19,862 INFO L349 Elim1Store]: treesize reduction 152, result has 24.8 percent of original size [2025-02-06 04:10:19,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 97 treesize of output 119