./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.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-a_file-5.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 ca2f933d67faf408af35a2606c62cae5d484e0ad1d571925efee98edf8420268 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:16:47,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:16:47,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:16:47,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:16:47,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:16:47,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:16:47,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:16:47,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:16:47,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:16:47,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:16:47,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:16:47,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:16:47,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:16:47,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:16:47,515 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:16:47,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:16:47,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:16:47,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:16:47,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:16:47,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:16:47,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:16:47,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:16:47,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:16:47,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:16:47,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:16:47,517 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:16:47,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:16:47,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:16:47,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:16:47,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:16:47,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:16:47,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:16:47,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:16:47,518 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 -> ca2f933d67faf408af35a2606c62cae5d484e0ad1d571925efee98edf8420268 [2025-02-06 03:16:47,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:16:47,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:16:47,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:16:47,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:16:47,789 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:16:47,790 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-a_file-5.i [2025-02-06 03:16:48,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9c22cf6/fbb3282047424a35985aaad24b00e1c9/FLAGfb779e0d0 [2025-02-06 03:16:49,256 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:16:49,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-5.i [2025-02-06 03:16:49,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9c22cf6/fbb3282047424a35985aaad24b00e1c9/FLAGfb779e0d0 [2025-02-06 03:16:49,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9c22cf6/fbb3282047424a35985aaad24b00e1c9 [2025-02-06 03:16:49,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:16:49,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:16:49,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:16:49,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:16:49,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:16:49,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6720282b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49, skipping insertion in model container [2025-02-06 03:16:49,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:16:49,410 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-a_file-5.i[915,928] [2025-02-06 03:16:49,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:16:49,466 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:16:49,473 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-a_file-5.i[915,928] [2025-02-06 03:16:49,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:16:49,517 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:16:49,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49 WrapperNode [2025-02-06 03:16:49,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:16:49,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:16:49,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:16:49,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:16:49,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,568 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2025-02-06 03:16:49,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:16:49,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:16:49,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:16:49,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:16:49,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,599 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 3, 28, 59, 24]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 6, 4, 3]. The 17 writes are split as follows [0, 1, 1, 6, 6, 3]. [2025-02-06 03:16:49,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:16:49,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:16:49,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:16:49,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:16:49,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (1/1) ... [2025-02-06 03:16:49,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:16:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:16:49,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:16:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:16:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:16:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:16:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:16:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:16:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:16:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:16:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:16:49,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:16:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:16:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:16:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:16:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:16:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:16:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:16:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:16:49,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:16:49,760 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:16:49,763 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:16:50,182 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~ite76#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~ite91#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short92#1;havoc property_#t~mem96#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short114#1; [2025-02-06 03:16:50,215 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-02-06 03:16:50,215 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:16:50,227 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:16:50,229 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:16:50,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:16:50 BoogieIcfgContainer [2025-02-06 03:16:50,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:16:50,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:16:50,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:16:50,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:16:50,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:16:49" (1/3) ... [2025-02-06 03:16:50,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c27e4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:16:50, skipping insertion in model container [2025-02-06 03:16:50,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:16:49" (2/3) ... [2025-02-06 03:16:50,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c27e4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:16:50, skipping insertion in model container [2025-02-06 03:16:50,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:16:50" (3/3) ... [2025-02-06 03:16:50,237 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-5.i [2025-02-06 03:16:50,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:16:50,249 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-5.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:16:50,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:16:50,300 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;@38c28a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:16:50,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:16:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:16:50,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:50,314 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:50,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:50,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1987051945, now seen corresponding path program 1 times [2025-02-06 03:16:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18377448] [2025-02-06 03:16:50,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:50,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:50,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:50,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:50,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 03:16:50,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:50,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18377448] [2025-02-06 03:16:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18377448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:50,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172498774] [2025-02-06 03:16:50,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:50,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:50,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:16:50,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:16:50,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:16:50,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:50,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:50,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:50,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:50,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:16:50,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 03:16:50,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:50,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172498774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:50,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:16:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:16:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698028105] [2025-02-06 03:16:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:50,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:16:50,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:50,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:16:50,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:16:50,833 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:16:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:50,857 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2025-02-06 03:16:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:16:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2025-02-06 03:16:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:50,864 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:16:50,865 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:16:50,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:16:50,869 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:50,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:16:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 03:16:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2025-02-06 03:16:50,900 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 148 [2025-02-06 03:16:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:50,900 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2025-02-06 03:16:50,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:16:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2025-02-06 03:16:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:16:50,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:50,903 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:50,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:16:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:16:51,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:51,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash 669362749, now seen corresponding path program 1 times [2025-02-06 03:16:51,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618006376] [2025-02-06 03:16:51,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:51,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:51,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:51,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:51,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 03:16:51,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:51,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618006376] [2025-02-06 03:16:51,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618006376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:51,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868461888] [2025-02-06 03:16:51,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:51,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:51,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:16:51,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:16:51,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:16:51,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:51,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:51,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:51,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:51,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:16:51,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:51,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:51,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868461888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:51,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:16:51,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:16:51,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114598260] [2025-02-06 03:16:51,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:51,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:16:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:51,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:16:51,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:51,726 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:51,769 INFO L93 Difference]: Finished difference Result 184 states and 261 transitions. [2025-02-06 03:16:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:16:51,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-02-06 03:16:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:51,773 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:16:51,774 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:16:51,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:51,776 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:51,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:16:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-02-06 03:16:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-02-06 03:16:51,789 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 148 [2025-02-06 03:16:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-02-06 03:16:51,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-02-06 03:16:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:16:51,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:51,794 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:51,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:16:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:51,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1138091714, now seen corresponding path program 1 times [2025-02-06 03:16:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628264892] [2025-02-06 03:16:51,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:52,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:52,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:52,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:52,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 03:16:52,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628264892] [2025-02-06 03:16:52,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628264892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305505447] [2025-02-06 03:16:52,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:52,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:16:52,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:16:52,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:16:52,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:52,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:52,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:52,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:16:52,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:52,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305505447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:52,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:16:52,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:16:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254159269] [2025-02-06 03:16:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:52,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:16:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:52,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:16:52,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:52,475 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:52,513 INFO L93 Difference]: Finished difference Result 188 states and 265 transitions. [2025-02-06 03:16:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:16:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-02-06 03:16:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:52,520 INFO L225 Difference]: With dead ends: 188 [2025-02-06 03:16:52,520 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 03:16:52,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:52,521 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:52,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 03:16:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-02-06 03:16:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2025-02-06 03:16:52,537 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 148 [2025-02-06 03:16:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:52,538 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2025-02-06 03:16:52,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2025-02-06 03:16:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:16:52,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:52,542 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:52,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:16:52,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:52,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:52,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -250588033, now seen corresponding path program 1 times [2025-02-06 03:16:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151214180] [2025-02-06 03:16:52,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:52,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:52,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:52,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:52,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 03:16:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151214180] [2025-02-06 03:16:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151214180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057771293] [2025-02-06 03:16:52,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:52,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:16:52,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:16:52,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:16:53,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:53,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:53,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:53,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:53,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:16:53,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:53,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057771293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:16:53,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:16:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673496768] [2025-02-06 03:16:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:53,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:16:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:53,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:16:53,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:53,117 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:53,144 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2025-02-06 03:16:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:16:53,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-02-06 03:16:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:53,146 INFO L225 Difference]: With dead ends: 192 [2025-02-06 03:16:53,146 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 03:16:53,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:53,147 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:53,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 03:16:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-02-06 03:16:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-02-06 03:16:53,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 148 [2025-02-06 03:16:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:53,158 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-02-06 03:16:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-02-06 03:16:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 03:16:53,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:53,161 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:53,168 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 03:16:53,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:53,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:53,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash -249664512, now seen corresponding path program 1 times [2025-02-06 03:16:53,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:53,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211319188] [2025-02-06 03:16:53,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:53,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:53,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:53,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:53,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:53,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 03:16:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211319188] [2025-02-06 03:16:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211319188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523836233] [2025-02-06 03:16:53,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:53,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:53,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:16:53,512 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:16:53,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:16:53,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 03:16:53,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 03:16:53,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:53,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:53,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:16:53,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:53,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:53,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523836233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:53,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:16:53,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:16:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261315254] [2025-02-06 03:16:53,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:53,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:16:53,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:53,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:16:53,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:16:53,658 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:53,675 INFO L93 Difference]: Finished difference Result 195 states and 272 transitions. [2025-02-06 03:16:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:16:53,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2025-02-06 03:16:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:53,677 INFO L225 Difference]: With dead ends: 195 [2025-02-06 03:16:53,677 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:16:53,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:16:53,678 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:53,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:16:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 03:16:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2025-02-06 03:16:53,683 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 148 [2025-02-06 03:16:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:53,683 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2025-02-06 03:16:53,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2025-02-06 03:16:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:16:53,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:53,685 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:53,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:16:53,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:53,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:53,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 77472638, now seen corresponding path program 1 times [2025-02-06 03:16:53,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:53,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362930086] [2025-02-06 03:16:53,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:53,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:53,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:16:53,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:16:53,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:53,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362930086] [2025-02-06 03:16:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362930086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:54,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:54,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:16:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774044465] [2025-02-06 03:16:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:54,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:16:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:54,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:16:54,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:16:54,059 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:54,101 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2025-02-06 03:16:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:16:54,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-02-06 03:16:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:54,102 INFO L225 Difference]: With dead ends: 197 [2025-02-06 03:16:54,102 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:16:54,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:16:54,103 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:54,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:16:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 03:16:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2025-02-06 03:16:54,110 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 150 [2025-02-06 03:16:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:54,111 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2025-02-06 03:16:54,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2025-02-06 03:16:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 03:16:54,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:54,112 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:54,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:16:54,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:54,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash -433061539, now seen corresponding path program 1 times [2025-02-06 03:16:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:54,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277313220] [2025-02-06 03:16:54,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:54,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 03:16:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 03:16:54,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:54,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277313220] [2025-02-06 03:16:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277313220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:16:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770269315] [2025-02-06 03:16:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:16:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:54,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:16:54,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:16:54,350 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:54,363 INFO L93 Difference]: Finished difference Result 197 states and 271 transitions. [2025-02-06 03:16:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:16:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-02-06 03:16:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:54,365 INFO L225 Difference]: With dead ends: 197 [2025-02-06 03:16:54,366 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:16:54,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:16:54,367 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:54,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:16:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 03:16:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2025-02-06 03:16:54,373 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 150 [2025-02-06 03:16:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:54,373 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2025-02-06 03:16:54,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2025-02-06 03:16:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:16:54,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:54,374 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:54,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:16:54,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:54,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash 947770431, now seen corresponding path program 1 times [2025-02-06 03:16:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130525336] [2025-02-06 03:16:54,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:54,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:16:54,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:16:54,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:54,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:54,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:54,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130525336] [2025-02-06 03:16:54,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130525336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:54,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:54,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:16:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169580450] [2025-02-06 03:16:54,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:54,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:16:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:54,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:16:54,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:16:54,563 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:54,610 INFO L93 Difference]: Finished difference Result 197 states and 269 transitions. [2025-02-06 03:16:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:16:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-02-06 03:16:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:54,611 INFO L225 Difference]: With dead ends: 197 [2025-02-06 03:16:54,611 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 03:16:54,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:16:54,612 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:54,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 03:16:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 03:16:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 78 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2025-02-06 03:16:54,620 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 152 [2025-02-06 03:16:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:54,620 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2025-02-06 03:16:54,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2025-02-06 03:16:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:16:54,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:54,622 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:54,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:16:54,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:54,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1159121344, now seen corresponding path program 1 times [2025-02-06 03:16:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052337546] [2025-02-06 03:16:54,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:54,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:16:54,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:16:54,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:54,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:55,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052337546] [2025-02-06 03:16:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052337546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:16:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950820141] [2025-02-06 03:16:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:55,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:16:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:55,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:16:55,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:16:55,873 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:56,430 INFO L93 Difference]: Finished difference Result 352 states and 481 transitions. [2025-02-06 03:16:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:16:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-02-06 03:16:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:56,432 INFO L225 Difference]: With dead ends: 352 [2025-02-06 03:16:56,432 INFO L226 Difference]: Without dead ends: 255 [2025-02-06 03:16:56,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:16:56,433 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 141 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:56,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 862 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:16:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-06 03:16:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 191. [2025-02-06 03:16:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 148 states have (on average 1.2094594594594594) internal successors, (179), 148 states have internal predecessors, (179), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:16:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2025-02-06 03:16:56,456 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 152 [2025-02-06 03:16:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:56,456 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2025-02-06 03:16:56,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2025-02-06 03:16:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 03:16:56,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:56,460 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:16:56,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -322883206, now seen corresponding path program 1 times [2025-02-06 03:16:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178994772] [2025-02-06 03:16:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:56,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:16:56,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:16:56,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:56,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 03:16:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178994772] [2025-02-06 03:16:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178994772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:16:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645922250] [2025-02-06 03:16:56,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:56,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:16:56,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:16:56,633 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:16:56,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:16:56,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 03:16:56,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 03:16:56,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:56,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:56,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:16:56,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:16:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:56,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:16:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645922250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:56,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:16:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:16:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86056330] [2025-02-06 03:16:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:16:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:56,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:16:56,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:56,792 INFO L87 Difference]: Start difference. First operand 191 states and 259 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:56,817 INFO L93 Difference]: Finished difference Result 385 states and 523 transitions. [2025-02-06 03:16:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:16:56,817 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2025-02-06 03:16:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:56,819 INFO L225 Difference]: With dead ends: 385 [2025-02-06 03:16:56,819 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 03:16:56,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:16:56,820 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:56,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 03:16:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-06 03:16:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 154 states have internal predecessors, (185), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:16:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2025-02-06 03:16:56,831 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 152 [2025-02-06 03:16:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2025-02-06 03:16:56,831 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2025-02-06 03:16:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 03:16:56,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:56,832 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:56,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:16:57,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 03:16:57,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:57,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1022051668, now seen corresponding path program 1 times [2025-02-06 03:16:57,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:57,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775583846] [2025-02-06 03:16:57,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:57,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 03:16:57,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 03:16:57,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:58,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:58,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775583846] [2025-02-06 03:16:58,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775583846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:58,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:58,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:16:58,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052406892] [2025-02-06 03:16:58,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:58,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:16:58,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:58,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:16:58,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:16:58,426 INFO L87 Difference]: Start difference. First operand 197 states and 265 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:16:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:58,860 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2025-02-06 03:16:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:16:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2025-02-06 03:16:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:58,863 INFO L225 Difference]: With dead ends: 363 [2025-02-06 03:16:58,864 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 03:16:58,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:16:58,865 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 116 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:58,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1461 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:16:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 03:16:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 101. [2025-02-06 03:16:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 79 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2025-02-06 03:16:58,881 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 153 [2025-02-06 03:16:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:58,881 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2025-02-06 03:16:58,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:16:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2025-02-06 03:16:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 03:16:58,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:58,883 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:58,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:16:58,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:58,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash 946066527, now seen corresponding path program 1 times [2025-02-06 03:16:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514652253] [2025-02-06 03:16:58,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:58,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 03:16:58,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 03:16:58,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:58,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514652253] [2025-02-06 03:16:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514652253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:59,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:16:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157769195] [2025-02-06 03:16:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:59,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:16:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:59,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:16:59,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:16:59,156 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:59,222 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2025-02-06 03:16:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:16:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2025-02-06 03:16:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:59,225 INFO L225 Difference]: With dead ends: 199 [2025-02-06 03:16:59,225 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:16:59,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:16:59,226 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:59,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:16:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:16:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 03:16:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2025-02-06 03:16:59,232 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 154 [2025-02-06 03:16:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:59,232 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2025-02-06 03:16:59,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:16:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2025-02-06 03:16:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:16:59,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:59,233 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:59,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:16:59,234 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:59,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1189013892, now seen corresponding path program 1 times [2025-02-06 03:16:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:59,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985431133] [2025-02-06 03:16:59,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:59,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:59,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:16:59,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:16:59,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:59,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:59,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985431133] [2025-02-06 03:16:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985431133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:59,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:16:59,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589367544] [2025-02-06 03:16:59,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:59,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:16:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:59,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:16:59,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:16:59,504 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:16:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:16:59,544 INFO L93 Difference]: Finished difference Result 240 states and 314 transitions. [2025-02-06 03:16:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:16:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2025-02-06 03:16:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:16:59,546 INFO L225 Difference]: With dead ends: 240 [2025-02-06 03:16:59,546 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:16:59,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:16:59,547 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 66 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:16:59,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 463 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:16:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:16:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2025-02-06 03:16:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 95 states have internal predecessors, (112), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:16:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2025-02-06 03:16:59,553 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 156 [2025-02-06 03:16:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:16:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2025-02-06 03:16:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:16:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2025-02-06 03:16:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:16:59,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:16:59,555 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:16:59,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:16:59,555 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:16:59,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:16:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1469490478, now seen corresponding path program 1 times [2025-02-06 03:16:59,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:16:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070028743] [2025-02-06 03:16:59,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:16:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:16:59,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:16:59,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:16:59,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:16:59,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:16:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:16:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:16:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070028743] [2025-02-06 03:16:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070028743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:16:59,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:16:59,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:16:59,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57409834] [2025-02-06 03:16:59,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:16:59,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:16:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:16:59,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:16:59,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:16:59,994 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:00,131 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2025-02-06 03:17:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-02-06 03:17:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:00,133 INFO L225 Difference]: With dead ends: 144 [2025-02-06 03:17:00,133 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:17:00,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:17:00,134 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:00,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 578 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:17:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-02-06 03:17:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.1545454545454545) internal successors, (127), 111 states have internal predecessors, (127), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:17:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2025-02-06 03:17:00,144 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 156 [2025-02-06 03:17:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:00,144 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2025-02-06 03:17:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2025-02-06 03:17:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:17:00,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:00,145 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:17:00,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1470413999, now seen corresponding path program 1 times [2025-02-06 03:17:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137576898] [2025-02-06 03:17:00,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:17:00,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:17:00,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:00,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:00,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137576898] [2025-02-06 03:17:00,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137576898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:00,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:00,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810984106] [2025-02-06 03:17:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:00,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:00,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:00,618 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:00,876 INFO L93 Difference]: Finished difference Result 400 states and 520 transitions. [2025-02-06 03:17:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-02-06 03:17:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:00,878 INFO L225 Difference]: With dead ends: 400 [2025-02-06 03:17:00,878 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 03:17:00,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:00,879 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 118 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:00,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 597 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:17:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 03:17:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 261. [2025-02-06 03:17:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 195 states have (on average 1.1282051282051282) internal successors, (220), 196 states have internal predecessors, (220), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:17:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 340 transitions. [2025-02-06 03:17:00,898 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 340 transitions. Word has length 156 [2025-02-06 03:17:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:00,899 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 340 transitions. [2025-02-06 03:17:00,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 340 transitions. [2025-02-06 03:17:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:17:00,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:00,900 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:00,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:17:00,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:00,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1937049616, now seen corresponding path program 1 times [2025-02-06 03:17:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:00,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017252177] [2025-02-06 03:17:00,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:00,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:17:00,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:17:00,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:00,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:01,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:01,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017252177] [2025-02-06 03:17:01,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017252177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:01,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:01,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:17:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175614230] [2025-02-06 03:17:01,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:01,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:01,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:01,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:17:01,081 INFO L87 Difference]: Start difference. First operand 261 states and 340 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:01,136 INFO L93 Difference]: Finished difference Result 497 states and 643 transitions. [2025-02-06 03:17:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-02-06 03:17:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:01,139 INFO L225 Difference]: With dead ends: 497 [2025-02-06 03:17:01,139 INFO L226 Difference]: Without dead ends: 284 [2025-02-06 03:17:01,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:01,140 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 109 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:01,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 686 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-06 03:17:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 261. [2025-02-06 03:17:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 195 states have (on average 1.117948717948718) internal successors, (218), 196 states have internal predecessors, (218), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:17:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 338 transitions. [2025-02-06 03:17:01,162 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 338 transitions. Word has length 156 [2025-02-06 03:17:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:01,162 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 338 transitions. [2025-02-06 03:17:01,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 338 transitions. [2025-02-06 03:17:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:17:01,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:01,163 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:01,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:17:01,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:01,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash 550463217, now seen corresponding path program 1 times [2025-02-06 03:17:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727656971] [2025-02-06 03:17:01,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:01,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:17:01,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:17:01,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:01,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 03:17:01,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727656971] [2025-02-06 03:17:01,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727656971] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833670125] [2025-02-06 03:17:01,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:01,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:01,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:17:01,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:17:01,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:17:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:17:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:01,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:17:01,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:01,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:17:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833670125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:17:01,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054644587] [2025-02-06 03:17:01,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:01,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:01,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:01,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:01,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:01,454 INFO L87 Difference]: Start difference. First operand 261 states and 338 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:01,488 INFO L93 Difference]: Finished difference Result 480 states and 617 transitions. [2025-02-06 03:17:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2025-02-06 03:17:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:01,491 INFO L225 Difference]: With dead ends: 480 [2025-02-06 03:17:01,491 INFO L226 Difference]: Without dead ends: 267 [2025-02-06 03:17:01,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:01,492 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:01,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-06 03:17:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-02-06 03:17:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 201 states have (on average 1.1144278606965174) internal successors, (224), 202 states have internal predecessors, (224), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:17:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 344 transitions. [2025-02-06 03:17:01,514 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 344 transitions. Word has length 156 [2025-02-06 03:17:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 344 transitions. [2025-02-06 03:17:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2025-02-06 03:17:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 03:17:01,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:01,515 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:01,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 03:17:01,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:01,716 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:01,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1952819216, now seen corresponding path program 1 times [2025-02-06 03:17:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077364371] [2025-02-06 03:17:01,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:01,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 03:17:01,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 03:17:01,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:01,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:02,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077364371] [2025-02-06 03:17:02,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077364371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:02,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:02,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:17:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335307479] [2025-02-06 03:17:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:02,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:17:02,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:02,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:17:02,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:02,067 INFO L87 Difference]: Start difference. First operand 267 states and 344 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:02,226 INFO L93 Difference]: Finished difference Result 446 states and 568 transitions. [2025-02-06 03:17:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:17:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2025-02-06 03:17:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:02,229 INFO L225 Difference]: With dead ends: 446 [2025-02-06 03:17:02,229 INFO L226 Difference]: Without dead ends: 322 [2025-02-06 03:17:02,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:17:02,229 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 68 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:02,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 902 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-06 03:17:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 268. [2025-02-06 03:17:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 202 states have (on average 1.113861386138614) internal successors, (225), 203 states have internal predecessors, (225), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:17:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 345 transitions. [2025-02-06 03:17:02,253 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 345 transitions. Word has length 157 [2025-02-06 03:17:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:02,253 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 345 transitions. [2025-02-06 03:17:02,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 345 transitions. [2025-02-06 03:17:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 03:17:02,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:02,254 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:02,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:17:02,255 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:02,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash 317279811, now seen corresponding path program 1 times [2025-02-06 03:17:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:02,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481898097] [2025-02-06 03:17:02,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:02,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 03:17:02,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 03:17:02,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:02,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481898097] [2025-02-06 03:17:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481898097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:02,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:02,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403963004] [2025-02-06 03:17:02,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:02,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:02,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:02,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:02,508 INFO L87 Difference]: Start difference. First operand 268 states and 345 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:02,573 INFO L93 Difference]: Finished difference Result 424 states and 538 transitions. [2025-02-06 03:17:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:17:02,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2025-02-06 03:17:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:02,575 INFO L225 Difference]: With dead ends: 424 [2025-02-06 03:17:02,575 INFO L226 Difference]: Without dead ends: 299 [2025-02-06 03:17:02,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:17:02,576 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 41 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:02,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 731 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:17:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-06 03:17:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 268. [2025-02-06 03:17:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 202 states have (on average 1.108910891089109) internal successors, (224), 203 states have internal predecessors, (224), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:17:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 344 transitions. [2025-02-06 03:17:02,600 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 344 transitions. Word has length 157 [2025-02-06 03:17:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:02,600 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 344 transitions. [2025-02-06 03:17:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 344 transitions. [2025-02-06 03:17:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:17:02,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:02,601 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:02,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:17:02,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash -733115149, now seen corresponding path program 1 times [2025-02-06 03:17:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565445465] [2025-02-06 03:17:02,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:02,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:17:02,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:17:02,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:02,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:17:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857612084] [2025-02-06 03:17:02,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:02,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:02,735 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:17:02,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:17:02,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:17:02,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:17:02,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:02,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:02,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 03:17:02,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:03,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:03,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-06 03:17:03,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:03,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2025-02-06 03:17:03,345 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 29 treesize of output 3 [2025-02-06 03:17:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:17:03,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:17:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565445465] [2025-02-06 03:17:04,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:17:04,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857612084] [2025-02-06 03:17:04,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857612084] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:04,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:17:04,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 03:17:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575416947] [2025-02-06 03:17:04,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:04,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:04,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:04,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:04,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:17:04,090 INFO L87 Difference]: Start difference. First operand 268 states and 344 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:05,028 INFO L93 Difference]: Finished difference Result 621 states and 773 transitions. [2025-02-06 03:17:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:05,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-02-06 03:17:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:05,031 INFO L225 Difference]: With dead ends: 621 [2025-02-06 03:17:05,031 INFO L226 Difference]: Without dead ends: 401 [2025-02-06 03:17:05,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:17:05,034 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 56 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:05,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 400 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:17:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-06 03:17:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 275. [2025-02-06 03:17:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 230 states have (on average 1.108695652173913) internal successors, (255), 230 states have internal predecessors, (255), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:17:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 335 transitions. [2025-02-06 03:17:05,057 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 335 transitions. Word has length 158 [2025-02-06 03:17:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:05,057 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 335 transitions. [2025-02-06 03:17:05,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 335 transitions. [2025-02-06 03:17:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 03:17:05,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:05,058 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:05,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:17:05,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:05,263 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:05,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash 122201000, now seen corresponding path program 1 times [2025-02-06 03:17:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731591651] [2025-02-06 03:17:05,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:05,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:05,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 03:17:05,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 03:17:05,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:05,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731591651] [2025-02-06 03:17:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731591651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:17:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104173400] [2025-02-06 03:17:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:06,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:17:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:06,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:17:06,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:17:06,378 INFO L87 Difference]: Start difference. First operand 275 states and 335 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:06,753 INFO L93 Difference]: Finished difference Result 491 states and 597 transitions. [2025-02-06 03:17:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:17:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2025-02-06 03:17:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:06,755 INFO L225 Difference]: With dead ends: 491 [2025-02-06 03:17:06,755 INFO L226 Difference]: Without dead ends: 330 [2025-02-06 03:17:06,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:17:06,756 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:06,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1073 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:17:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-06 03:17:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 295. [2025-02-06 03:17:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 250 states have (on average 1.112) internal successors, (278), 250 states have internal predecessors, (278), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:17:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2025-02-06 03:17:06,776 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 159 [2025-02-06 03:17:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:06,777 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2025-02-06 03:17:06,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2025-02-06 03:17:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-06 03:17:06,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:06,778 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:17:06,778 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1351759440, now seen corresponding path program 1 times [2025-02-06 03:17:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983577919] [2025-02-06 03:17:06,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:06,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 03:17:06,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 03:17:06,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:06,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983577919] [2025-02-06 03:17:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983577919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:17:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115256270] [2025-02-06 03:17:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:17:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:07,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:17:07,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:07,363 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 03:17:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:07,531 INFO L93 Difference]: Finished difference Result 543 states and 651 transitions. [2025-02-06 03:17:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:17:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2025-02-06 03:17:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:07,534 INFO L225 Difference]: With dead ends: 543 [2025-02-06 03:17:07,534 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 03:17:07,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:17:07,535 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 44 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:07,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 918 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 03:17:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 325. [2025-02-06 03:17:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 280 states have (on average 1.1071428571428572) internal successors, (310), 280 states have internal predecessors, (310), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:17:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 390 transitions. [2025-02-06 03:17:07,552 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 390 transitions. Word has length 159 [2025-02-06 03:17:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:07,553 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 390 transitions. [2025-02-06 03:17:07,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 03:17:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 390 transitions. [2025-02-06 03:17:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:17:07,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:07,554 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:07,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:17:07,554 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:07,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1214942367, now seen corresponding path program 1 times [2025-02-06 03:17:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:07,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154532692] [2025-02-06 03:17:07,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:07,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:17:07,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:17:07,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:07,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154532692] [2025-02-06 03:17:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154532692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:07,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:17:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328984875] [2025-02-06 03:17:07,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:07,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:17:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:07,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:17:07,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:17:07,705 INFO L87 Difference]: Start difference. First operand 325 states and 390 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:07,982 INFO L93 Difference]: Finished difference Result 901 states and 1072 transitions. [2025-02-06 03:17:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:17:07,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-02-06 03:17:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:07,985 INFO L225 Difference]: With dead ends: 901 [2025-02-06 03:17:07,985 INFO L226 Difference]: Without dead ends: 690 [2025-02-06 03:17:07,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:17:07,986 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 264 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:07,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 385 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:17:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-06 03:17:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 562. [2025-02-06 03:17:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 473 states have (on average 1.0909090909090908) internal successors, (516), 473 states have internal predecessors, (516), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:17:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 676 transitions. [2025-02-06 03:17:08,017 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 676 transitions. Word has length 160 [2025-02-06 03:17:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 676 transitions. [2025-02-06 03:17:08,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 676 transitions. [2025-02-06 03:17:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:17:08,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:08,019 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:08,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:17:08,019 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1305695651, now seen corresponding path program 1 times [2025-02-06 03:17:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603717493] [2025-02-06 03:17:08,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:08,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:17:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:17:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:08,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:08,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603717493] [2025-02-06 03:17:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603717493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:08,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:17:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489882520] [2025-02-06 03:17:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:08,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:17:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:08,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:17:08,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:08,292 INFO L87 Difference]: Start difference. First operand 562 states and 676 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:08,460 INFO L93 Difference]: Finished difference Result 982 states and 1179 transitions. [2025-02-06 03:17:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:17:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-02-06 03:17:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:08,463 INFO L225 Difference]: With dead ends: 982 [2025-02-06 03:17:08,463 INFO L226 Difference]: Without dead ends: 615 [2025-02-06 03:17:08,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:17:08,465 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 61 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:08,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1069 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:17:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-06 03:17:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 542. [2025-02-06 03:17:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 453 states have (on average 1.0883002207505519) internal successors, (493), 453 states have internal predecessors, (493), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-06 03:17:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 653 transitions. [2025-02-06 03:17:08,507 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 653 transitions. Word has length 160 [2025-02-06 03:17:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:08,507 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 653 transitions. [2025-02-06 03:17:08,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 653 transitions. [2025-02-06 03:17:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:17:08,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:08,508 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:08,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:17:08,508 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:08,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:08,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1656856363, now seen corresponding path program 1 times [2025-02-06 03:17:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075187185] [2025-02-06 03:17:08,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:08,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:17:08,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:17:08,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075187185] [2025-02-06 03:17:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075187185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:17:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781693829] [2025-02-06 03:17:09,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:09,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:17:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:09,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:17:09,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:17:09,875 INFO L87 Difference]: Start difference. First operand 542 states and 653 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 03:17:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:10,900 INFO L93 Difference]: Finished difference Result 942 states and 1133 transitions. [2025-02-06 03:17:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:17:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-02-06 03:17:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:10,904 INFO L225 Difference]: With dead ends: 942 [2025-02-06 03:17:10,904 INFO L226 Difference]: Without dead ends: 630 [2025-02-06 03:17:10,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:17:10,905 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 142 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:10,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1151 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:17:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-02-06 03:17:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 618. [2025-02-06 03:17:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 514 states have (on average 1.0856031128404668) internal successors, (558), 515 states have internal predecessors, (558), 93 states have call successors, (93), 10 states have call predecessors, (93), 10 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-06 03:17:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 744 transitions. [2025-02-06 03:17:10,941 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 744 transitions. Word has length 160 [2025-02-06 03:17:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:10,941 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 744 transitions. [2025-02-06 03:17:10,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 03:17:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 744 transitions. [2025-02-06 03:17:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:17:10,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:10,943 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:17:10,943 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:10,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1950259370, now seen corresponding path program 1 times [2025-02-06 03:17:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152466558] [2025-02-06 03:17:10,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:10,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:17:11,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:17:11,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:11,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152466558] [2025-02-06 03:17:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152466558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:17:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231288240] [2025-02-06 03:17:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:17:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:11,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:17:11,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:17:11,585 INFO L87 Difference]: Start difference. First operand 618 states and 744 transitions. Second operand has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-06 03:17:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:11,885 INFO L93 Difference]: Finished difference Result 1152 states and 1380 transitions. [2025-02-06 03:17:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:17:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) Word has length 160 [2025-02-06 03:17:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:11,888 INFO L225 Difference]: With dead ends: 1152 [2025-02-06 03:17:11,889 INFO L226 Difference]: Without dead ends: 764 [2025-02-06 03:17:11,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:17:11,890 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 79 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:11,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1274 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:17:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-02-06 03:17:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 760. [2025-02-06 03:17:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 634 states have (on average 1.0788643533123028) internal successors, (684), 636 states have internal predecessors, (684), 112 states have call successors, (112), 13 states have call predecessors, (112), 13 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:17:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 908 transitions. [2025-02-06 03:17:11,937 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 908 transitions. Word has length 160 [2025-02-06 03:17:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:11,937 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 908 transitions. [2025-02-06 03:17:11,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-06 03:17:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 908 transitions. [2025-02-06 03:17:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:17:11,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:11,938 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:11,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:17:11,939 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1306056426, now seen corresponding path program 1 times [2025-02-06 03:17:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793196730] [2025-02-06 03:17:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:11,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:17:11,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:17:11,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:11,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793196730] [2025-02-06 03:17:12,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793196730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:12,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:12,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:17:12,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494777507] [2025-02-06 03:17:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:17:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:17:12,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:17:12,442 INFO L87 Difference]: Start difference. First operand 760 states and 908 transitions. Second operand has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-06 03:17:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:12,736 INFO L93 Difference]: Finished difference Result 1435 states and 1725 transitions. [2025-02-06 03:17:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:17:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) Word has length 160 [2025-02-06 03:17:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:12,740 INFO L225 Difference]: With dead ends: 1435 [2025-02-06 03:17:12,740 INFO L226 Difference]: Without dead ends: 920 [2025-02-06 03:17:12,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:17:12,742 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 81 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:12,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 890 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:17:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-02-06 03:17:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 841. [2025-02-06 03:17:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 679 states have (on average 1.0662739322533137) internal successors, (724), 683 states have internal predecessors, (724), 144 states have call successors, (144), 17 states have call predecessors, (144), 17 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-06 03:17:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1012 transitions. [2025-02-06 03:17:12,836 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1012 transitions. Word has length 160 [2025-02-06 03:17:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:12,837 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1012 transitions. [2025-02-06 03:17:12,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 12.6) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-06 03:17:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1012 transitions. [2025-02-06 03:17:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:17:12,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:12,838 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:12,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:17:12,838 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1599459433, now seen corresponding path program 1 times [2025-02-06 03:17:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627727029] [2025-02-06 03:17:12,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:12,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:17:12,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:17:12,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627727029] [2025-02-06 03:17:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627727029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:17:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979132576] [2025-02-06 03:17:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:14,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:17:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:14,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:17:14,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:17:14,159 INFO L87 Difference]: Start difference. First operand 841 states and 1012 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 03:17:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:15,409 INFO L93 Difference]: Finished difference Result 1400 states and 1680 transitions. [2025-02-06 03:17:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:17:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-02-06 03:17:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:15,413 INFO L225 Difference]: With dead ends: 1400 [2025-02-06 03:17:15,414 INFO L226 Difference]: Without dead ends: 845 [2025-02-06 03:17:15,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:17:15,419 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 115 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:15,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1110 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:17:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-02-06 03:17:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 778. [2025-02-06 03:17:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 634 states have (on average 1.0678233438485805) internal successors, (677), 637 states have internal predecessors, (677), 128 states have call successors, (128), 15 states have call predecessors, (128), 15 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-06 03:17:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 933 transitions. [2025-02-06 03:17:15,531 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 933 transitions. Word has length 160 [2025-02-06 03:17:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:15,531 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 933 transitions. [2025-02-06 03:17:15,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-02-06 03:17:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 933 transitions. [2025-02-06 03:17:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:17:15,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:15,532 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:15,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:17:15,533 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 852715534, now seen corresponding path program 1 times [2025-02-06 03:17:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:15,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822986242] [2025-02-06 03:17:15,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:15,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:17:15,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:17:15,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:15,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822986242] [2025-02-06 03:17:26,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822986242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:26,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:17:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960175183] [2025-02-06 03:17:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:26,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:17:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:26,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:17:26,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=258, Unknown=2, NotChecked=0, Total=306 [2025-02-06 03:17:26,055 INFO L87 Difference]: Start difference. First operand 778 states and 933 transitions. Second operand has 18 states, 15 states have (on average 4.4) internal successors, (66), 18 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 03:17:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:31,967 INFO L93 Difference]: Finished difference Result 1222 states and 1462 transitions. [2025-02-06 03:17:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 03:17:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.4) internal successors, (66), 18 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2025-02-06 03:17:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:31,972 INFO L225 Difference]: With dead ends: 1222 [2025-02-06 03:17:31,973 INFO L226 Difference]: Without dead ends: 905 [2025-02-06 03:17:31,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=97, Invalid=602, Unknown=3, NotChecked=0, Total=702 [2025-02-06 03:17:31,974 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 135 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:31,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2051 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:17:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-02-06 03:17:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 779. [2025-02-06 03:17:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 635 states have (on average 1.0677165354330709) internal successors, (678), 638 states have internal predecessors, (678), 128 states have call successors, (128), 15 states have call predecessors, (128), 15 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-06 03:17:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 934 transitions. [2025-02-06 03:17:32,028 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 934 transitions. Word has length 163 [2025-02-06 03:17:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:32,028 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 934 transitions. [2025-02-06 03:17:32,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.4) internal successors, (66), 18 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-06 03:17:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 934 transitions. [2025-02-06 03:17:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:17:32,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:32,030 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:32,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:17:32,030 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:32,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1624364400, now seen corresponding path program 1 times [2025-02-06 03:17:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040311868] [2025-02-06 03:17:32,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:32,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:17:32,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:17:32,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:32,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-06 03:17:33,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040311868] [2025-02-06 03:17:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040311868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:33,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:17:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80349016] [2025-02-06 03:17:33,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:33,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:17:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:33,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:17:33,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:17:33,090 INFO L87 Difference]: Start difference. First operand 779 states and 934 transitions. Second operand has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:33,943 INFO L93 Difference]: Finished difference Result 1214 states and 1449 transitions. [2025-02-06 03:17:33,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:17:33,944 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2025-02-06 03:17:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:33,947 INFO L225 Difference]: With dead ends: 1214 [2025-02-06 03:17:33,948 INFO L226 Difference]: Without dead ends: 896 [2025-02-06 03:17:33,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:17:33,950 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 65 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:33,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1376 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:17:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-02-06 03:17:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 833. [2025-02-06 03:17:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 674 states have (on average 1.0652818991097923) internal successors, (718), 678 states have internal predecessors, (718), 141 states have call successors, (141), 17 states have call predecessors, (141), 17 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-02-06 03:17:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1000 transitions. [2025-02-06 03:17:34,016 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1000 transitions. Word has length 163 [2025-02-06 03:17:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:34,016 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1000 transitions. [2025-02-06 03:17:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 03:17:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1000 transitions. [2025-02-06 03:17:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-06 03:17:34,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:34,019 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:17:34,019 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:34,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1530969985, now seen corresponding path program 1 times [2025-02-06 03:17:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594924688] [2025-02-06 03:17:34,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:34,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 03:17:34,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 03:17:34,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:34,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 3145 trivial. 0 not checked. [2025-02-06 03:17:36,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:36,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594924688] [2025-02-06 03:17:36,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594924688] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:36,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305633467] [2025-02-06 03:17:36,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:36,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:36,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:17:36,254 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:17:36,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 03:17:36,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 03:17:36,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 03:17:36,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:36,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:36,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:17:36,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:17:36,585 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 9 treesize of output 3 [2025-02-06 03:17:36,599 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 17 treesize of output 17 [2025-02-06 03:17:36,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:17:36,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 03:17:36,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:17:36,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:17:36,755 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 28 treesize of output 17 [2025-02-06 03:17:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 661 proven. 409 refuted. 0 times theorem prover too weak. 2122 trivial. 0 not checked. [2025-02-06 03:17:36,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:17:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3171 trivial. 0 not checked. [2025-02-06 03:17:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305633467] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:17:36,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:17:36,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 6] total 8 [2025-02-06 03:17:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262829663] [2025-02-06 03:17:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:36,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:17:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:36,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:17:36,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:17:36,979 INFO L87 Difference]: Start difference. First operand 833 states and 1000 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:37,241 INFO L93 Difference]: Finished difference Result 1394 states and 1662 transitions. [2025-02-06 03:17:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:17:37,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 312 [2025-02-06 03:17:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:37,249 INFO L225 Difference]: With dead ends: 1394 [2025-02-06 03:17:37,249 INFO L226 Difference]: Without dead ends: 861 [2025-02-06 03:17:37,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:17:37,251 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 96 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:37,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 549 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:17:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-02-06 03:17:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 794. [2025-02-06 03:17:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 630 states have (on average 1.0571428571428572) internal successors, (666), 634 states have internal predecessors, (666), 145 states have call successors, (145), 18 states have call predecessors, (145), 18 states have return successors, (145), 141 states have call predecessors, (145), 145 states have call successors, (145) [2025-02-06 03:17:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 956 transitions. [2025-02-06 03:17:37,316 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 956 transitions. Word has length 312 [2025-02-06 03:17:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:37,316 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 956 transitions. [2025-02-06 03:17:37,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-06 03:17:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 956 transitions. [2025-02-06 03:17:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-06 03:17:37,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:17:37,319 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:37,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 03:17:37,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:17:37,520 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:17:37,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:17:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash 248675493, now seen corresponding path program 1 times [2025-02-06 03:17:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:17:37,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451732666] [2025-02-06 03:17:37,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:17:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:17:37,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-06 03:17:37,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-06 03:17:37,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:17:37,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:17:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 3164 trivial. 0 not checked. [2025-02-06 03:17:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:17:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451732666] [2025-02-06 03:17:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451732666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:17:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:17:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:17:39,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539882231] [2025-02-06 03:17:39,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:17:39,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:17:39,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:17:39,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:17:39,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:17:39,297 INFO L87 Difference]: Start difference. First operand 794 states and 956 transitions. Second operand has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-06 03:17:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:17:40,110 INFO L93 Difference]: Finished difference Result 1179 states and 1413 transitions. [2025-02-06 03:17:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:17:40,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 3 states have call successors, (22) Word has length 316 [2025-02-06 03:17:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:17:40,112 INFO L225 Difference]: With dead ends: 1179 [2025-02-06 03:17:40,112 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 03:17:40,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:17:40,114 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 63 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:17:40,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1371 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:17:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 03:17:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 03:17:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 03:17:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 03:17:40,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 316 [2025-02-06 03:17:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:17:40,128 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 03:17:40,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-06 03:17:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 03:17:40,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 03:17:40,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:17:40,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:17:40,137 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:17:40,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 03:18:01,735 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:18:01,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-06 03:18:01,751 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-06 03:18:01,751 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-06 03:18:01,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,757 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,757 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,757 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-02-06 03:18:01,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] [2025-02-06 03:18:01,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:18:01 BoogieIcfgContainer [2025-02-06 03:18:01,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:18:01,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:18:01,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:18:01,759 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:18:01,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:16:50" (3/4) ... [2025-02-06 03:18:01,765 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 03:18:01,772 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 03:18:01,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 03:18:01,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 03:18:01,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 03:18:01,782 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 03:18:01,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 03:18:01,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 03:18:01,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:18:01,905 INFO L158 Benchmark]: Toolchain (without parser) took 72618.77ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 113.2MB in the beginning and 707.4MB in the end (delta: -594.2MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2025-02-06 03:18:01,905 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:01,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.28ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 97.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:18:01,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.91ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:01,905 INFO L158 Benchmark]: Boogie Preprocessor took 55.22ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:18:01,905 INFO L158 Benchmark]: IcfgBuilder took 601.33ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 56.1MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:18:01,905 INFO L158 Benchmark]: TraceAbstraction took 71527.45ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 55.7MB in the beginning and 719.9MB in the end (delta: -664.2MB). Peak memory consumption was 448.2MB. Max. memory is 16.1GB. [2025-02-06 03:18:01,906 INFO L158 Benchmark]: Witness Printer took 145.34ms. Allocated memory is still 830.5MB. Free memory was 719.9MB in the beginning and 707.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:18:01,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.28ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 97.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.91ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.22ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 89.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 601.33ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 56.1MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 71527.45ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 55.7MB in the beginning and 719.9MB in the end (delta: -664.2MB). Peak memory consumption was 448.2MB. Max. memory is 16.1GB. * Witness Printer took 145.34ms. Allocated memory is still 830.5MB. Free memory was 719.9MB in the beginning and 707.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_short_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_char_Array_0~0!base,GLOBAL]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.9s, OverallIterations: 32, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1988 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1964 mSDsluCounter, 23487 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18798 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9303 IncrementalHoareTripleChecker+Invalid, 9495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 4689 mSDtfsCounter, 9303 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2401 GetRequests, 2121 SyntacticMatches, 4 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=841occurred in iteration=27, InterpolantAutomatonStates: 271, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 1198 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 6805 NumberOfCodeBlocks, 6805 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 7075 ConstructedInterpolants, 0 QuantifiedInterpolants, 27453 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4555 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 42 InterpolantComputations, 32 PerfectInterpolantSequences, 40349/41648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 03:18:02,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE