./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a41aa9d8768b1b5dd89ea1dccd189b98246dddc52870a67830fa0c3c6660983c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:36:46,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:36:46,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:36:46,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:36:46,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:36:46,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:36:46,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:36:46,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:36:46,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:36:46,950 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:36:46,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:36:46,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:36:46,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:36:46,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:36:46,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:36:46,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:36:46,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:36:46,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:36:46,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:36:46,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:36:46,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:36:46,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:36:46,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:46,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:36:46,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:36:46,954 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/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 -> a41aa9d8768b1b5dd89ea1dccd189b98246dddc52870a67830fa0c3c6660983c [2025-03-17 05:36:47,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:36:47,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:36:47,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:36:47,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:36:47,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:36:47,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i [2025-03-17 05:36:48,346 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699efdfcc/fad185f509c94ffe87501eb1fc8b7608/FLAG76329acc7 [2025-03-17 05:36:48,686 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:36:48,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i [2025-03-17 05:36:48,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699efdfcc/fad185f509c94ffe87501eb1fc8b7608/FLAG76329acc7 [2025-03-17 05:36:48,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699efdfcc/fad185f509c94ffe87501eb1fc8b7608 [2025-03-17 05:36:48,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:36:48,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:36:48,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:48,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:36:48,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:36:48,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa72034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48, skipping insertion in model container [2025-03-17 05:36:48,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:36:49,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i[917,930] [2025-03-17 05:36:49,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:49,168 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:36:49,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-58.i[917,930] [2025-03-17 05:36:49,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:49,229 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:36:49,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49 WrapperNode [2025-03-17 05:36:49,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:49,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:49,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:36:49,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:36:49,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,291 INFO L138 Inliner]: procedures = 26, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2025-03-17 05:36:49,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:49,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:36:49,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:36:49,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:36:49,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,338 INFO L175 MemorySlicer]: Split 125 memory accesses to 6 slices as follows [2, 6, 11, 7, 74, 25]. 59 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 6, 2]. The 15 writes are split as follows [0, 1, 1, 3, 8, 2]. [2025-03-17 05:36:49,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:36:49,372 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:36:49,372 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:36:49,372 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:36:49,373 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (1/1) ... [2025-03-17 05:36:49,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:49,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:49,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:36:49,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:36:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:36:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:36:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:36:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:36:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:36:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:36:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:36:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:36:49,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:36:49,501 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:36:49,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:36:49,834 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem68#1;havoc property_#t~ite83#1;havoc property_#t~mem74#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~ite73#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite82#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite115#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~short91#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite107#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~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:36:49,866 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-17 05:36:49,866 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:36:49,876 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:36:49,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:36:49,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:49 BoogieIcfgContainer [2025-03-17 05:36:49,877 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:36:49,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:36:49,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:36:49,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:36:49,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:36:48" (1/3) ... [2025-03-17 05:36:49,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f82442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:49, skipping insertion in model container [2025-03-17 05:36:49,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:49" (2/3) ... [2025-03-17 05:36:49,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f82442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:49, skipping insertion in model container [2025-03-17 05:36:49,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:49" (3/3) ... [2025-03-17 05:36:49,884 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-58.i [2025-03-17 05:36:49,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:36:49,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-58.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:36:49,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:36:49,945 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;@47ef3fb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:36:49,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:36:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:36:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:36:49,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:49,961 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:49,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:49,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1505427158, now seen corresponding path program 1 times [2025-03-17 05:36:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:49,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611406244] [2025-03-17 05:36:49,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:50,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:50,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:50,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:50,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:36:50,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:50,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611406244] [2025-03-17 05:36:50,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611406244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:50,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103616248] [2025-03-17 05:36:50,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:50,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:50,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:50,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:36:50,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:36:50,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:50,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:50,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:50,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:36:50,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 05:36:50,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103616248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:36:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460397] [2025-03-17 05:36:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:50,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:36:50,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:50,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:36:50,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:36:50,403 INFO L87 Difference]: Start difference. First operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:36:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:50,420 INFO L93 Difference]: Finished difference Result 165 states and 259 transitions. [2025-03-17 05:36:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:36:50,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-17 05:36:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:50,426 INFO L225 Difference]: With dead ends: 165 [2025-03-17 05:36:50,426 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:36:50,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-03-17 05:36:50,431 INFO L435 NwaCegarLoop]: 114 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, 114 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-03-17 05:36:50,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:36:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 05:36:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:36:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-17 05:36:50,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 112 [2025-03-17 05:36:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:50,462 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-17 05:36:50,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:36:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-17 05:36:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:36:50,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:50,465 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:50,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:36:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:36:50,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1811888891, now seen corresponding path program 1 times [2025-03-17 05:36:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210895722] [2025-03-17 05:36:50,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:50,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:50,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:50,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:50,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210895722] [2025-03-17 05:36:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210895722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:50,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:36:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267562035] [2025-03-17 05:36:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:50,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:36:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:50,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:36:50,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:36:50,981 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:51,017 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2025-03-17 05:36:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:36:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:36:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:51,018 INFO L225 Difference]: With dead ends: 162 [2025-03-17 05:36:51,019 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:36:51,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:36:51,021 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:51,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 324 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:36:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-17 05:36:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:36:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-17 05:36:51,032 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 112 [2025-03-17 05:36:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:51,035 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-17 05:36:51,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-17 05:36:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:36:51,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:51,038 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:51,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:36:51,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:51,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1812812412, now seen corresponding path program 1 times [2025-03-17 05:36:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987237841] [2025-03-17 05:36:51,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:51,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:51,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:51,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987237841] [2025-03-17 05:36:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987237841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:51,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240490926] [2025-03-17 05:36:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:51,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:51,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:51,480 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:51,655 INFO L93 Difference]: Finished difference Result 232 states and 327 transitions. [2025-03-17 05:36:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:51,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:36:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:51,660 INFO L225 Difference]: With dead ends: 232 [2025-03-17 05:36:51,661 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 05:36:51,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:51,663 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 91 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:51,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 481 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 05:36:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2025-03-17 05:36:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 118 states have internal predecessors, (153), 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-03-17 05:36:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 209 transitions. [2025-03-17 05:36:51,685 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 209 transitions. Word has length 112 [2025-03-17 05:36:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:51,686 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 209 transitions. [2025-03-17 05:36:51,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 209 transitions. [2025-03-17 05:36:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:36:51,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:51,689 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:51,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:36:51,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:51,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1737306880, now seen corresponding path program 1 times [2025-03-17 05:36:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:51,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486720850] [2025-03-17 05:36:51,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:51,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:51,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:51,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:51,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486720850] [2025-03-17 05:36:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486720850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:36:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770376093] [2025-03-17 05:36:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:52,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:36:52,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:52,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:36:52,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:36:52,422 INFO L87 Difference]: Start difference. First operand 148 states and 209 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:52,702 INFO L93 Difference]: Finished difference Result 351 states and 492 transitions. [2025-03-17 05:36:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:52,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:36:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:52,707 INFO L225 Difference]: With dead ends: 351 [2025-03-17 05:36:52,707 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 05:36:52,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:52,708 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 189 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:52,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 428 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:36:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 05:36:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2025-03-17 05:36:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 166 states have internal predecessors, (215), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:36:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 281 transitions. [2025-03-17 05:36:52,745 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 281 transitions. Word has length 112 [2025-03-17 05:36:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:52,746 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 281 transitions. [2025-03-17 05:36:52,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 281 transitions. [2025-03-17 05:36:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:36:52,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:52,749 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:52,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:36:52,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:52,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1608224161, now seen corresponding path program 1 times [2025-03-17 05:36:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436710708] [2025-03-17 05:36:52,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:52,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:52,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:52,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:52,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436710708] [2025-03-17 05:36:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436710708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:53,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:36:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591996954] [2025-03-17 05:36:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:53,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:36:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:53,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:36:53,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:36:53,740 INFO L87 Difference]: Start difference. First operand 201 states and 281 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:54,190 INFO L93 Difference]: Finished difference Result 416 states and 578 transitions. [2025-03-17 05:36:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:36:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:54,192 INFO L225 Difference]: With dead ends: 416 [2025-03-17 05:36:54,192 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 05:36:54,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:54,193 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 179 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:54,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 302 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:36:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 05:36:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2025-03-17 05:36:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 172 states have internal predecessors, (218), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:36:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2025-03-17 05:36:54,220 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 112 [2025-03-17 05:36:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:54,220 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2025-03-17 05:36:54,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2025-03-17 05:36:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:36:54,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:54,222 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:54,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:36:54,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:54,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -383997183, now seen corresponding path program 1 times [2025-03-17 05:36:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:54,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040005120] [2025-03-17 05:36:54,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:54,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:54,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:54,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:54,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:54,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040005120] [2025-03-17 05:36:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040005120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:36:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422579478] [2025-03-17 05:36:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:36:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:54,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:36:54,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:36:54,951 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:55,532 INFO L93 Difference]: Finished difference Result 416 states and 574 transitions. [2025-03-17 05:36:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:55,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:36:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:55,534 INFO L225 Difference]: With dead ends: 416 [2025-03-17 05:36:55,534 INFO L226 Difference]: Without dead ends: 219 [2025-03-17 05:36:55,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:55,536 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 165 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:55,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 433 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:36:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-17 05:36:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 180. [2025-03-17 05:36:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 144 states have internal predecessors, (181), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:36:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 247 transitions. [2025-03-17 05:36:55,566 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 247 transitions. Word has length 112 [2025-03-17 05:36:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:55,567 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 247 transitions. [2025-03-17 05:36:55,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 247 transitions. [2025-03-17 05:36:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:36:55,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:55,569 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:55,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:36:55,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -254914464, now seen corresponding path program 1 times [2025-03-17 05:36:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131904400] [2025-03-17 05:36:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:55,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:36:55,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:36:55,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:55,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131904400] [2025-03-17 05:36:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131904400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:55,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:36:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117593683] [2025-03-17 05:36:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:36:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:55,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:36:55,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:55,987 INFO L87 Difference]: Start difference. First operand 180 states and 247 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:56,263 INFO L93 Difference]: Finished difference Result 384 states and 526 transitions. [2025-03-17 05:36:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:36:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-17 05:36:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:56,269 INFO L225 Difference]: With dead ends: 384 [2025-03-17 05:36:56,269 INFO L226 Difference]: Without dead ends: 219 [2025-03-17 05:36:56,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:36:56,270 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 132 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:56,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 631 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:36:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-17 05:36:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 177. [2025-03-17 05:36:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.2733812949640289) internal successors, (177), 141 states have internal predecessors, (177), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:36:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 243 transitions. [2025-03-17 05:36:56,295 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 243 transitions. Word has length 112 [2025-03-17 05:36:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:56,295 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 243 transitions. [2025-03-17 05:36:56,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 243 transitions. [2025-03-17 05:36:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:36:56,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:56,296 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:56,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:36:56,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:56,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1208601102, now seen corresponding path program 1 times [2025-03-17 05:36:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860757068] [2025-03-17 05:36:56,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:56,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:36:56,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:36:56,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:56,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860757068] [2025-03-17 05:36:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860757068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:36:56,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320246066] [2025-03-17 05:36:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:56,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:36:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:56,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:36:56,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:56,880 INFO L87 Difference]: Start difference. First operand 177 states and 243 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:57,350 INFO L93 Difference]: Finished difference Result 438 states and 600 transitions. [2025-03-17 05:36:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:36:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2025-03-17 05:36:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:57,352 INFO L225 Difference]: With dead ends: 438 [2025-03-17 05:36:57,352 INFO L226 Difference]: Without dead ends: 276 [2025-03-17 05:36:57,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:36:57,353 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 195 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:57,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 561 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:36:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-17 05:36:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 219. [2025-03-17 05:36:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 181 states have (on average 1.3038674033149171) internal successors, (236), 183 states have internal predecessors, (236), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:36:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 302 transitions. [2025-03-17 05:36:57,380 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 302 transitions. Word has length 113 [2025-03-17 05:36:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 302 transitions. [2025-03-17 05:36:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 302 transitions. [2025-03-17 05:36:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:36:57,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:57,384 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:36:57,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:57,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1337683821, now seen corresponding path program 1 times [2025-03-17 05:36:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741593658] [2025-03-17 05:36:57,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:57,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:36:57,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:36:57,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:57,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:58,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741593658] [2025-03-17 05:36:58,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741593658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:58,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:58,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:36:58,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115407971] [2025-03-17 05:36:58,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:58,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:36:58,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:58,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:36:58,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:36:58,352 INFO L87 Difference]: Start difference. First operand 219 states and 302 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:36:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:58,869 INFO L93 Difference]: Finished difference Result 439 states and 604 transitions. [2025-03-17 05:36:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:58,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 113 [2025-03-17 05:36:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:58,872 INFO L225 Difference]: With dead ends: 439 [2025-03-17 05:36:58,872 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 05:36:58,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:36:58,873 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 174 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:58,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 366 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:36:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 05:36:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2025-03-17 05:36:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 180 states have (on average 1.3) internal successors, (234), 182 states have internal predecessors, (234), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:36:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 300 transitions. [2025-03-17 05:36:58,896 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 300 transitions. Word has length 113 [2025-03-17 05:36:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:58,896 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 300 transitions. [2025-03-17 05:36:58,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-17 05:36:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 300 transitions. [2025-03-17 05:36:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:36:58,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:58,897 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:36:58,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:58,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1953449106, now seen corresponding path program 1 times [2025-03-17 05:36:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752849745] [2025-03-17 05:36:58,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:58,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:36:58,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:36:58,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:58,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752849745] [2025-03-17 05:36:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752849745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:59,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047453080] [2025-03-17 05:36:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:59,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:59,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:59,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:59,130 INFO L87 Difference]: Start difference. First operand 218 states and 300 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:59,272 INFO L93 Difference]: Finished difference Result 436 states and 595 transitions. [2025-03-17 05:36:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:59,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2025-03-17 05:36:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:59,274 INFO L225 Difference]: With dead ends: 436 [2025-03-17 05:36:59,274 INFO L226 Difference]: Without dead ends: 219 [2025-03-17 05:36:59,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:59,275 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 91 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:59,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 425 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-17 05:36:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-03-17 05:36:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 177 states have (on average 1.2768361581920904) internal successors, (226), 179 states have internal predecessors, (226), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:36:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 292 transitions. [2025-03-17 05:36:59,300 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 292 transitions. Word has length 113 [2025-03-17 05:36:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 292 transitions. [2025-03-17 05:36:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:36:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 292 transitions. [2025-03-17 05:36:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:36:59,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:59,301 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:36:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:36:59,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:59,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash 211528749, now seen corresponding path program 1 times [2025-03-17 05:36:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765030917] [2025-03-17 05:36:59,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:59,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:36:59,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:36:59,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:59,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:36:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765030917] [2025-03-17 05:36:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765030917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:59,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:59,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:36:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963183545] [2025-03-17 05:36:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:59,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:36:59,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:59,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:36:59,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:36:59,740 INFO L87 Difference]: Start difference. First operand 216 states and 292 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:00,112 INFO L93 Difference]: Finished difference Result 438 states and 588 transitions. [2025-03-17 05:37:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:37:00,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2025-03-17 05:37:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:00,114 INFO L225 Difference]: With dead ends: 438 [2025-03-17 05:37:00,115 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 05:37:00,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:00,116 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 214 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:00,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 281 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:37:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 05:37:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 126. [2025-03-17 05:37:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:37:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2025-03-17 05:37:00,139 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 113 [2025-03-17 05:37:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2025-03-17 05:37:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2025-03-17 05:37:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:37:00,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:00,142 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:37:00,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 340611468, now seen corresponding path program 1 times [2025-03-17 05:37:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287453869] [2025-03-17 05:37:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:00,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:37:00,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:37:00,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:00,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287453869] [2025-03-17 05:37:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287453869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:37:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814256325] [2025-03-17 05:37:00,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:37:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:37:00,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:37:00,669 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:01,224 INFO L93 Difference]: Finished difference Result 290 states and 384 transitions. [2025-03-17 05:37:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:37:01,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2025-03-17 05:37:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:01,226 INFO L225 Difference]: With dead ends: 290 [2025-03-17 05:37:01,226 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 05:37:01,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:37:01,227 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 130 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:01,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 779 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:37:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 05:37:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2025-03-17 05:37:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:37:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2025-03-17 05:37:01,242 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 113 [2025-03-17 05:37:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:01,243 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2025-03-17 05:37:01,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2025-03-17 05:37:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:37:01,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:01,244 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:01,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:37:01,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1373708339, now seen corresponding path program 1 times [2025-03-17 05:37:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896555207] [2025-03-17 05:37:01,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:01,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:37:01,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:37:01,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:01,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896555207] [2025-03-17 05:37:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896555207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:01,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:37:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729356150] [2025-03-17 05:37:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:01,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:01,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:01,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:01,558 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:01,716 INFO L93 Difference]: Finished difference Result 303 states and 396 transitions. [2025-03-17 05:37:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:37:01,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2025-03-17 05:37:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:01,718 INFO L225 Difference]: With dead ends: 303 [2025-03-17 05:37:01,718 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 05:37:01,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-03-17 05:37:01,718 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 56 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:01,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 531 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 05:37:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 143. [2025-03-17 05:37:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.2419354838709677) internal successors, (154), 124 states have internal predecessors, (154), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 05:37:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2025-03-17 05:37:01,732 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 114 [2025-03-17 05:37:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:01,733 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2025-03-17 05:37:01,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2025-03-17 05:37:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:37:01,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:01,735 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:01,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:37:01,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:01,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1634352254, now seen corresponding path program 1 times [2025-03-17 05:37:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:01,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771783477] [2025-03-17 05:37:01,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:37:01,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:37:01,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:01,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:02,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:02,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771783477] [2025-03-17 05:37:02,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771783477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:02,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:02,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:37:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150884771] [2025-03-17 05:37:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:02,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:37:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:02,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:37:02,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:02,298 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:02,870 INFO L93 Difference]: Finished difference Result 384 states and 494 transitions. [2025-03-17 05:37:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:02,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2025-03-17 05:37:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:02,872 INFO L225 Difference]: With dead ends: 384 [2025-03-17 05:37:02,872 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 05:37:02,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:02,873 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 137 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:02,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 598 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 05:37:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 175. [2025-03-17 05:37:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.2483660130718954) internal successors, (191), 154 states have internal predecessors, (191), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:37:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2025-03-17 05:37:02,893 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 225 transitions. Word has length 115 [2025-03-17 05:37:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:02,893 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 225 transitions. [2025-03-17 05:37:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 225 transitions. [2025-03-17 05:37:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:37:02,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:02,894 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:02,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:37:02,894 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:02,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1051207128, now seen corresponding path program 1 times [2025-03-17 05:37:02,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:02,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089254458] [2025-03-17 05:37:02,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:02,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:37:02,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:37:02,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:02,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:03,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089254458] [2025-03-17 05:37:03,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089254458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:03,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:03,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:37:03,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660894074] [2025-03-17 05:37:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:03,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:03,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:03,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:03,490 INFO L87 Difference]: Start difference. First operand 175 states and 225 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:03,914 INFO L93 Difference]: Finished difference Result 381 states and 489 transitions. [2025-03-17 05:37:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:37:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2025-03-17 05:37:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:03,916 INFO L225 Difference]: With dead ends: 381 [2025-03-17 05:37:03,916 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 05:37:03,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:03,917 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 52 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:03,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 395 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:37:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 05:37:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 172. [2025-03-17 05:37:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:37:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 221 transitions. [2025-03-17 05:37:03,936 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 221 transitions. Word has length 116 [2025-03-17 05:37:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:03,936 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 221 transitions. [2025-03-17 05:37:03,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 221 transitions. [2025-03-17 05:37:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:37:03,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:03,937 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:03,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:37:03,937 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:03,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1284094922, now seen corresponding path program 1 times [2025-03-17 05:37:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:03,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342666242] [2025-03-17 05:37:03,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:03,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:37:03,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:37:03,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:03,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:04,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342666242] [2025-03-17 05:37:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342666242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:37:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792361363] [2025-03-17 05:37:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:04,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:37:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:04,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:37:04,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:04,722 INFO L87 Difference]: Start difference. First operand 172 states and 221 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:37:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:05,133 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2025-03-17 05:37:05,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:37:05,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2025-03-17 05:37:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:05,137 INFO L225 Difference]: With dead ends: 199 [2025-03-17 05:37:05,137 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 05:37:05,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:37:05,138 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 342 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:05,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 429 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:37:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 05:37:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2025-03-17 05:37:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 167 states have (on average 1.221556886227545) internal successors, (204), 169 states have internal predecessors, (204), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:37:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2025-03-17 05:37:05,171 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 116 [2025-03-17 05:37:05,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:05,173 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2025-03-17 05:37:05,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 05:37:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2025-03-17 05:37:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:37:05,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:05,174 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:05,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:37:05,174 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1285018443, now seen corresponding path program 1 times [2025-03-17 05:37:05,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:05,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076829437] [2025-03-17 05:37:05,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:05,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:37:05,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:37:05,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:05,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:06,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:06,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076829437] [2025-03-17 05:37:06,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076829437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:06,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:06,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 05:37:06,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037020771] [2025-03-17 05:37:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:06,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:37:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:06,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:37:06,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:37:06,951 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 18 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-17 05:37:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:09,005 INFO L93 Difference]: Finished difference Result 627 states and 796 transitions. [2025-03-17 05:37:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:37:09,006 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2025-03-17 05:37:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:09,008 INFO L225 Difference]: With dead ends: 627 [2025-03-17 05:37:09,008 INFO L226 Difference]: Without dead ends: 450 [2025-03-17 05:37:09,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 05:37:09,010 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 764 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:09,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 611 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:37:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-17 05:37:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 363. [2025-03-17 05:37:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 318 states have (on average 1.2232704402515724) internal successors, (389), 322 states have internal predecessors, (389), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:37:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 459 transitions. [2025-03-17 05:37:09,057 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 459 transitions. Word has length 116 [2025-03-17 05:37:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:09,057 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 459 transitions. [2025-03-17 05:37:09,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-17 05:37:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 459 transitions. [2025-03-17 05:37:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:37:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:09,059 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:09,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:37:09,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1218011690, now seen corresponding path program 1 times [2025-03-17 05:37:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549143782] [2025-03-17 05:37:09,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:09,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:37:09,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:37:09,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:09,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:09,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:09,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549143782] [2025-03-17 05:37:09,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549143782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:09,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:09,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:37:09,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412889141] [2025-03-17 05:37:09,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:09,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:09,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:09,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:09,234 INFO L87 Difference]: Start difference. First operand 363 states and 459 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:37:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:09,438 INFO L93 Difference]: Finished difference Result 884 states and 1122 transitions. [2025-03-17 05:37:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-17 05:37:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:09,441 INFO L225 Difference]: With dead ends: 884 [2025-03-17 05:37:09,441 INFO L226 Difference]: Without dead ends: 515 [2025-03-17 05:37:09,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:09,443 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 80 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:09,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 591 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-17 05:37:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2025-03-17 05:37:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 447 states have (on average 1.2192393736017897) internal successors, (545), 452 states have internal predecessors, (545), 52 states have call successors, (52), 13 states have call predecessors, (52), 13 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:37:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 649 transitions. [2025-03-17 05:37:09,513 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 649 transitions. Word has length 116 [2025-03-17 05:37:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:09,514 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 649 transitions. [2025-03-17 05:37:09,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:37:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 649 transitions. [2025-03-17 05:37:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:37:09,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:09,516 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:09,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:37:09,516 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:09,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1289887227, now seen corresponding path program 1 times [2025-03-17 05:37:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:09,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716124375] [2025-03-17 05:37:09,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:09,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:37:09,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:37:09,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:09,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 05:37:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716124375] [2025-03-17 05:37:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716124375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745204431] [2025-03-17 05:37:10,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:10,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:10,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:10,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:37:10,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:37:10,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:37:10,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:37:10,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:10,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:10,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-17 05:37:10,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:11,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:37:12,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:37:12,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:37:13,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-17 05:37:14,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:14,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:14,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:14,579 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2025-03-17 05:37:14,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 51 [2025-03-17 05:37:15,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:15,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:15,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:15,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:15,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:15,040 INFO L349 Elim1Store]: treesize reduction 65, result has 18.8 percent of original size [2025-03-17 05:37:15,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 69 [2025-03-17 05:37:16,403 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 48 treesize of output 36 [2025-03-17 05:37:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 73 proven. 308 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-17 05:37:16,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:37:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745204431] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:37:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 28] total 47 [2025-03-17 05:37:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125435570] [2025-03-17 05:37:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:37:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:17,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:37:17,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1975, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 05:37:17,645 INFO L87 Difference]: Start difference. First operand 513 states and 649 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:18,367 INFO L93 Difference]: Finished difference Result 1001 states and 1251 transitions. [2025-03-17 05:37:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:37:18,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-03-17 05:37:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:18,371 INFO L225 Difference]: With dead ends: 1001 [2025-03-17 05:37:18,371 INFO L226 Difference]: Without dead ends: 657 [2025-03-17 05:37:18,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=218, Invalid=2232, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 05:37:18,372 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 168 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:18,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 466 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-17 05:37:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 415. [2025-03-17 05:37:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 362 states have (on average 1.218232044198895) internal successors, (441), 363 states have internal predecessors, (441), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 523 transitions. [2025-03-17 05:37:18,432 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 523 transitions. Word has length 117 [2025-03-17 05:37:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:18,432 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 523 transitions. [2025-03-17 05:37:18,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 523 transitions. [2025-03-17 05:37:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:37:18,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:18,433 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:18,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:37:18,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:18,638 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:18,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1418969946, now seen corresponding path program 1 times [2025-03-17 05:37:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:18,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600903698] [2025-03-17 05:37:18,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:18,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:37:18,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:37:18,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:18,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 75 proven. 33 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 05:37:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:20,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600903698] [2025-03-17 05:37:20,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600903698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:20,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572427839] [2025-03-17 05:37:20,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:20,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:20,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:20,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:37:20,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:37:20,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:37:20,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:37:20,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:20,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:20,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-03-17 05:37:20,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:21,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:37:23,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:37:24,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:37:25,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-03-17 05:37:26,954 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 23 treesize of output 3 [2025-03-17 05:37:28,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2025-03-17 05:37:29,258 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2025-03-17 05:37:29,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 80 [2025-03-17 05:37:29,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:29,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:29,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:29,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:29,768 INFO L349 Elim1Store]: treesize reduction 65, result has 18.8 percent of original size [2025-03-17 05:37:29,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 93 [2025-03-17 05:37:34,804 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 60 treesize of output 44 [2025-03-17 05:37:34,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:37:34,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 53 [2025-03-17 05:37:34,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:34,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:34,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:37:34,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2025-03-17 05:37:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 81 proven. 308 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-17 05:37:35,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:37:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572427839] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:37:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [24, 43] total 69 [2025-03-17 05:37:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210719452] [2025-03-17 05:37:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:37,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:37:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:37,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:37:37,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=4258, Unknown=0, NotChecked=0, Total=4692 [2025-03-17 05:37:37,153 INFO L87 Difference]: Start difference. First operand 415 states and 523 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:37,798 INFO L93 Difference]: Finished difference Result 861 states and 1075 transitions. [2025-03-17 05:37:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:37,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-03-17 05:37:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:37,801 INFO L225 Difference]: With dead ends: 861 [2025-03-17 05:37:37,801 INFO L226 Difference]: Without dead ends: 566 [2025-03-17 05:37:37,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=452, Invalid=4518, Unknown=0, NotChecked=0, Total=4970 [2025-03-17 05:37:37,805 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 111 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:37,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 372 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:37:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-17 05:37:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 411. [2025-03-17 05:37:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 358 states have (on average 1.2094972067039107) internal successors, (433), 359 states have internal predecessors, (433), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 515 transitions. [2025-03-17 05:37:37,862 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 515 transitions. Word has length 117 [2025-03-17 05:37:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:37,862 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 515 transitions. [2025-03-17 05:37:37,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 515 transitions. [2025-03-17 05:37:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:37:37,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:37,863 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:37,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:37:38,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:38,064 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:38,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1285691814, now seen corresponding path program 1 times [2025-03-17 05:37:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648173332] [2025-03-17 05:37:38,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:37:38,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:37:38,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:38,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:38,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:38,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648173332] [2025-03-17 05:37:38,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648173332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:38,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:37:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823146446] [2025-03-17 05:37:38,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:38,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:37:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:38,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:37:38,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:37:38,854 INFO L87 Difference]: Start difference. First operand 411 states and 515 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-17 05:37:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:39,566 INFO L93 Difference]: Finished difference Result 826 states and 1032 transitions. [2025-03-17 05:37:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:37:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 117 [2025-03-17 05:37:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:39,569 INFO L225 Difference]: With dead ends: 826 [2025-03-17 05:37:39,569 INFO L226 Difference]: Without dead ends: 416 [2025-03-17 05:37:39,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:37:39,570 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 424 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:39,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 477 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-17 05:37:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 405. [2025-03-17 05:37:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 352 states have (on average 1.2017045454545454) internal successors, (423), 353 states have internal predecessors, (423), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 505 transitions. [2025-03-17 05:37:39,659 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 505 transitions. Word has length 117 [2025-03-17 05:37:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:39,659 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 505 transitions. [2025-03-17 05:37:39,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-17 05:37:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 505 transitions. [2025-03-17 05:37:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:37:39,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:39,661 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:39,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:37:39,662 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:39,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1123739219, now seen corresponding path program 1 times [2025-03-17 05:37:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:39,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-17 05:37:39,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:39,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:37:39,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:37:39,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:39,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-17 05:37:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49233133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:41,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 05:37:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954574072] [2025-03-17 05:37:41,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:41,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:37:41,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:41,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:37:41,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:37:41,585 INFO L87 Difference]: Start difference. First operand 405 states and 505 transitions. Second operand has 20 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 19 states have internal predecessors, (46), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-17 05:37:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:43,914 INFO L93 Difference]: Finished difference Result 1075 states and 1313 transitions. [2025-03-17 05:37:43,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:37:43,917 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 19 states have internal predecessors, (46), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) Word has length 118 [2025-03-17 05:37:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:43,919 INFO L225 Difference]: With dead ends: 1075 [2025-03-17 05:37:43,919 INFO L226 Difference]: Without dead ends: 671 [2025-03-17 05:37:43,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=917, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 05:37:43,922 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 239 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:43,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 872 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 05:37:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-17 05:37:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 399. [2025-03-17 05:37:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 346 states have (on average 1.1965317919075145) internal successors, (414), 347 states have internal predecessors, (414), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 496 transitions. [2025-03-17 05:37:43,978 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 496 transitions. Word has length 118 [2025-03-17 05:37:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:43,978 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 496 transitions. [2025-03-17 05:37:43,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 19 states have internal predecessors, (46), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-17 05:37:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 496 transitions. [2025-03-17 05:37:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:37:43,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:43,979 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:43,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:37:43,979 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:43,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash -69617750, now seen corresponding path program 1 times [2025-03-17 05:37:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466664101] [2025-03-17 05:37:43,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:43,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:37:44,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:37:44,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:44,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:44,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466664101] [2025-03-17 05:37:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466664101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:44,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:44,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:37:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682661175] [2025-03-17 05:37:44,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:37:44,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:44,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:37:44,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:44,222 INFO L87 Difference]: Start difference. First operand 399 states and 496 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:44,453 INFO L93 Difference]: Finished difference Result 984 states and 1208 transitions. [2025-03-17 05:37:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:44,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 118 [2025-03-17 05:37:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:44,457 INFO L225 Difference]: With dead ends: 984 [2025-03-17 05:37:44,457 INFO L226 Difference]: Without dead ends: 586 [2025-03-17 05:37:44,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-03-17 05:37:44,458 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 54 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:44,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 724 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-17 05:37:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 452. [2025-03-17 05:37:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.1854636591478698) internal successors, (473), 400 states have internal predecessors, (473), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 555 transitions. [2025-03-17 05:37:44,521 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 555 transitions. Word has length 118 [2025-03-17 05:37:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:44,522 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 555 transitions. [2025-03-17 05:37:44,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 555 transitions. [2025-03-17 05:37:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:37:44,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:44,523 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:44,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:37:44,523 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:44,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1659303324, now seen corresponding path program 1 times [2025-03-17 05:37:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:44,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340998369] [2025-03-17 05:37:44,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:44,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:37:44,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:37:44,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:44,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340998369] [2025-03-17 05:37:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340998369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:44,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894823168] [2025-03-17 05:37:44,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:44,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:44,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:44,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:44,677 INFO L87 Difference]: Start difference. First operand 452 states and 555 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:44,888 INFO L93 Difference]: Finished difference Result 1001 states and 1225 transitions. [2025-03-17 05:37:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2025-03-17 05:37:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:44,890 INFO L225 Difference]: With dead ends: 1001 [2025-03-17 05:37:44,890 INFO L226 Difference]: Without dead ends: 550 [2025-03-17 05:37:44,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:44,891 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 46 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:44,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 411 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-17 05:37:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 455. [2025-03-17 05:37:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 402 states have (on average 1.1840796019900497) internal successors, (476), 403 states have internal predecessors, (476), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 558 transitions. [2025-03-17 05:37:44,982 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 558 transitions. Word has length 123 [2025-03-17 05:37:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 558 transitions. [2025-03-17 05:37:44,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 558 transitions. [2025-03-17 05:37:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:37:44,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:44,983 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:44,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:37:44,983 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1530220605, now seen corresponding path program 1 times [2025-03-17 05:37:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725009603] [2025-03-17 05:37:44,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:37:45,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:37:45,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:45,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:45,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:45,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725009603] [2025-03-17 05:37:45,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725009603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:45,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:45,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600360265] [2025-03-17 05:37:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:45,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:45,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:45,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:45,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:45,111 INFO L87 Difference]: Start difference. First operand 455 states and 558 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:45,218 INFO L93 Difference]: Finished difference Result 977 states and 1192 transitions. [2025-03-17 05:37:45,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:45,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2025-03-17 05:37:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:45,220 INFO L225 Difference]: With dead ends: 977 [2025-03-17 05:37:45,220 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 05:37:45,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:45,221 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 34 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:45,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 518 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 05:37:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 452. [2025-03-17 05:37:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.1704260651629073) internal successors, (467), 400 states have internal predecessors, (467), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 549 transitions. [2025-03-17 05:37:45,290 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 549 transitions. Word has length 123 [2025-03-17 05:37:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:45,290 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 549 transitions. [2025-03-17 05:37:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 549 transitions. [2025-03-17 05:37:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:37:45,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:45,291 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:45,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:37:45,291 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:45,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash 847216645, now seen corresponding path program 1 times [2025-03-17 05:37:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:45,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472893215] [2025-03-17 05:37:45,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:45,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:37:45,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:37:45,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:45,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472893215] [2025-03-17 05:37:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472893215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:37:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764934271] [2025-03-17 05:37:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:45,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:37:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:45,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:37:45,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:45,639 INFO L87 Difference]: Start difference. First operand 452 states and 549 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:37:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:45,987 INFO L93 Difference]: Finished difference Result 944 states and 1141 transitions. [2025-03-17 05:37:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:37:45,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-03-17 05:37:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:45,990 INFO L225 Difference]: With dead ends: 944 [2025-03-17 05:37:45,990 INFO L226 Difference]: Without dead ends: 493 [2025-03-17 05:37:45,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:37:45,991 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:45,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 329 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-17 05:37:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 452. [2025-03-17 05:37:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.162907268170426) internal successors, (464), 400 states have internal predecessors, (464), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 546 transitions. [2025-03-17 05:37:46,044 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 546 transitions. Word has length 123 [2025-03-17 05:37:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:46,045 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 546 transitions. [2025-03-17 05:37:46,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 05:37:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 546 transitions. [2025-03-17 05:37:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:37:46,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:46,046 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:46,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:37:46,046 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:46,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:46,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1419193973, now seen corresponding path program 1 times [2025-03-17 05:37:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:46,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951390602] [2025-03-17 05:37:46,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:46,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:37:46,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:37:46,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:46,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:46,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951390602] [2025-03-17 05:37:46,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951390602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:46,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:46,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:46,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20160141] [2025-03-17 05:37:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:46,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:46,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:46,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:46,202 INFO L87 Difference]: Start difference. First operand 452 states and 546 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:46,393 INFO L93 Difference]: Finished difference Result 927 states and 1117 transitions. [2025-03-17 05:37:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-03-17 05:37:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:46,396 INFO L225 Difference]: With dead ends: 927 [2025-03-17 05:37:46,396 INFO L226 Difference]: Without dead ends: 605 [2025-03-17 05:37:46,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:46,397 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 89 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:46,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 476 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-17 05:37:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 452. [2025-03-17 05:37:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.1528822055137844) internal successors, (460), 400 states have internal predecessors, (460), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 542 transitions. [2025-03-17 05:37:46,456 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 542 transitions. Word has length 128 [2025-03-17 05:37:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 542 transitions. [2025-03-17 05:37:46,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 542 transitions. [2025-03-17 05:37:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:37:46,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:46,458 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:37:46,458 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2112295670, now seen corresponding path program 1 times [2025-03-17 05:37:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767690523] [2025-03-17 05:37:46,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:46,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:37:46,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:37:46,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:46,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 05:37:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:46,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767690523] [2025-03-17 05:37:46,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767690523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:46,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:46,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734954771] [2025-03-17 05:37:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:46,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:46,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:46,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:46,622 INFO L87 Difference]: Start difference. First operand 452 states and 542 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:46,796 INFO L93 Difference]: Finished difference Result 927 states and 1109 transitions. [2025-03-17 05:37:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:46,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-03-17 05:37:46,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:46,799 INFO L225 Difference]: With dead ends: 927 [2025-03-17 05:37:46,799 INFO L226 Difference]: Without dead ends: 605 [2025-03-17 05:37:46,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:46,800 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:46,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 476 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-17 05:37:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 468. [2025-03-17 05:37:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 415 states have (on average 1.1518072289156627) internal successors, (478), 416 states have internal predecessors, (478), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 05:37:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 560 transitions. [2025-03-17 05:37:46,855 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 560 transitions. Word has length 128 [2025-03-17 05:37:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:46,855 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 560 transitions. [2025-03-17 05:37:46,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 05:37:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 560 transitions. [2025-03-17 05:37:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:37:46,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:46,856 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:37:46,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:37:46,856 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1818892663, now seen corresponding path program 1 times [2025-03-17 05:37:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:46,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930688885] [2025-03-17 05:37:46,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:37:46,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:37:46,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:46,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat