./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c -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 08e27279d8b0f092d8b126b1fa68f6a49bc0b5cda6842121ef1790310988da5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:15:38,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:15:39,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:15:39,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:15:39,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:15:39,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:15:39,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:15:39,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:15:39,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:15:39,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:15:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:15:39,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:15:39,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:15:39,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:15:39,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:15:39,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:39,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:15:39,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:15:39,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:15:39,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:15:39,029 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 -> 08e27279d8b0f092d8b126b1fa68f6a49bc0b5cda6842121ef1790310988da5f [2025-03-03 15:15:39,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:15:39,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:15:39,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:15:39,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:15:39,257 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:15:39,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2025-03-03 15:15:40,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4bfc9a74/fc9be9a687454268ac15897d5adc42ee/FLAGb4738825a [2025-03-03 15:15:40,784 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:15:40,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2025-03-03 15:15:40,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4bfc9a74/fc9be9a687454268ac15897d5adc42ee/FLAGb4738825a [2025-03-03 15:15:40,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4bfc9a74/fc9be9a687454268ac15897d5adc42ee [2025-03-03 15:15:40,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:15:40,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:15:40,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:40,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:15:40,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:15:40,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:40" (1/1) ... [2025-03-03 15:15:40,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:40, skipping insertion in model container [2025-03-03 15:15:40,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:15:40" (1/1) ... [2025-03-03 15:15:41,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:15:41,273 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[14183,14196] [2025-03-03 15:15:41,298 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[18907,18920] [2025-03-03 15:15:41,307 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[20199,20212] [2025-03-03 15:15:41,310 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[20957,20970] [2025-03-03 15:15:41,316 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[22620,22633] [2025-03-03 15:15:41,319 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[23378,23391] [2025-03-03 15:15:41,322 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[24507,24520] [2025-03-03 15:15:41,329 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[27132,27145] [2025-03-03 15:15:41,332 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[27893,27906] [2025-03-03 15:15:41,336 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[29025,29038] [2025-03-03 15:15:41,342 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[31116,31129] [2025-03-03 15:15:41,359 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[35211,35224] [2025-03-03 15:15:41,364 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[35972,35985] [2025-03-03 15:15:41,369 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[37065,37078] [2025-03-03 15:15:41,375 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[39117,39130] [2025-03-03 15:15:41,384 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[42849,42862] [2025-03-03 15:15:41,403 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[50027,50040] [2025-03-03 15:15:41,407 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[50788,50801] [2025-03-03 15:15:41,410 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[51920,51933] [2025-03-03 15:15:41,414 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[54011,54024] [2025-03-03 15:15:41,422 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[57572,57585] [2025-03-03 15:15:41,433 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[63570,63583] [2025-03-03 15:15:41,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:41,622 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:15:41,665 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[14183,14196] [2025-03-03 15:15:41,674 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[18907,18920] [2025-03-03 15:15:41,678 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[20199,20212] [2025-03-03 15:15:41,680 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[20957,20970] [2025-03-03 15:15:41,685 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[22620,22633] [2025-03-03 15:15:41,687 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[23378,23391] [2025-03-03 15:15:41,690 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[24507,24520] [2025-03-03 15:15:41,697 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[27132,27145] [2025-03-03 15:15:41,700 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[27893,27906] [2025-03-03 15:15:41,703 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[29025,29038] [2025-03-03 15:15:41,708 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[31116,31129] [2025-03-03 15:15:41,717 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[35211,35224] [2025-03-03 15:15:41,720 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[35972,35985] [2025-03-03 15:15:41,725 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[37065,37078] [2025-03-03 15:15:41,731 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[39117,39130] [2025-03-03 15:15:41,738 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[42849,42862] [2025-03-03 15:15:41,753 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[50027,50040] [2025-03-03 15:15:41,755 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[50788,50801] [2025-03-03 15:15:41,758 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[51920,51933] [2025-03-03 15:15:41,762 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[54011,54024] [2025-03-03 15:15:41,769 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[57572,57585] [2025-03-03 15:15:41,779 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c[63570,63583] [2025-03-03 15:15:41,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:15:41,951 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:15:41,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41 WrapperNode [2025-03-03 15:15:41,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:15:41,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:41,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:15:41,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:15:41,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:41,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,083 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7085 [2025-03-03 15:15:42,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:15:42,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:15:42,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:15:42,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:15:42,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,160 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:15:42,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:15:42,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:15:42,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:15:42,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:15:42,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (1/1) ... [2025-03-03 15:15:42,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:15:42,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:15:42,329 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-03 15:15:42,333 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-03 15:15:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:15:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:15:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:15:42,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:15:42,569 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:15:42,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:15:45,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10276: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-03 15:15:45,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7370: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~67#1; [2025-03-03 15:15:45,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:15:45,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4465: havoc main_~check__tmp~41#1;havoc main_~node6__m6~27#1; [2025-03-03 15:15:45,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8826: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-03 15:15:45,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6712: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~60#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6316: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~56#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc main_~check__tmp~22#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4864: havoc main_~node6__m6~31#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2354: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~53#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10150: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~97#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8433: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node3__m3~1#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: havoc main_~check__tmp~25#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3546: havoc main_~check__tmp~31#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5396: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~46#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2225: havoc main_~node4__m4~4#1; [2025-03-03 15:15:45,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7114: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L905: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9626: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~91#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3284: havoc main_~node3__m3~4#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9230: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~87#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: havoc main_~node6__m6~8#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8043: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L644: havoc main_~node3__m3~2#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1569: havoc main_~check__tmp~9#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6590: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8572: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~80#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6194: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8310: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~77#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10293: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3951: havoc main_~check__tmp~36#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1177: havoc main_~node6__m6~3#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-03 15:15:45,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5274: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4085: havoc main_~node5__m5~13#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10956: havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~106#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4746: havoc main_~node4__m4~9#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5804: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6994: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~63#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031: havoc main_~node5__m5~9#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node4__m4~1#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3428: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2107: havoc main_~check__tmp~16#1;havoc main_~node6__m6~9#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8450: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2240: havoc main_~node5__m5~6#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10432: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~100#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3694: havoc main_~check__tmp~33#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3299: havoc main_~node4__m4~6#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5678: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~49#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1451: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7661: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L659: havoc main_~node4__m4~2#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9116: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~86#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10834: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8060: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4362: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~39#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5023: havoc main_~node6__m6~33#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10310: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4761: havoc main_~node5__m5~16#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7800: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~72#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: havoc main_~node4__m4~5#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7538: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~69#1; [2025-03-03 15:15:45,142 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9917: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5821: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L536: havoc main_~node5__m5~1#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc main_~node6__m6~10#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8994: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6880: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~62#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6484: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~58#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3314: havoc main_~node5__m5~10#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10714: havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~103#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc main_~node5__m5~2#1; [2025-03-03 15:15:45,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9527: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846: havoc main_~node4__m4~7#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5960: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~52#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10056: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~96#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7678: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1337: havoc main_~node5__m5~3#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9794: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~93#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9398: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~89#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8077: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: havoc main_~node5__m5~7#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2396: havoc main_~node6__m6~11#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8740: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~82#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6362: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-03 15:15:45,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7288: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8874: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~83#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2796: havoc main_~node5__m5~8#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L815: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4647: havoc main_~node6__m6~29#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc main_~node6__m6~1#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8216: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~76#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9934: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L950: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3329: havoc main_~node6__m6~18#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7162: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~65#1; [2025-03-03 15:15:45,145 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5445: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: havoc main_~node6__m6~2#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3861: havoc main_~node5__m5~12#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8618: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10600: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~102#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1352: havoc main_~node6__m6~4#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9544: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4127: havoc main_~check__tmp~38#1;havoc main_~node6__m6~24#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6638: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~59#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6242: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~55#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: havoc main_~node6__m6~12#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1223: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8094: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3073: havoc main_~check__tmp~27#1;havoc main_~node6__m6~16#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5584: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~48#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: havoc main_~node6__m6~19#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811: havoc main_~node6__m6~14#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3604: havoc main_~node5__m5~11#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5322: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~45#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4398: havoc main_~check__tmp~40#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7305: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10478: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-03 15:15:45,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7968: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~74#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1494: havoc main_~node6__m6~5#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2684: havoc main_~check__tmp~23#1;havoc main_~node6__m6~13#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8498: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~79#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892: havoc main_~check__tmp~13#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3876: havoc main_~node6__m6~22#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5462: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7444: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~68#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: havoc main_~check__tmp~26#1;havoc main_~node6__m6~15#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4803: havoc main_~check__tmp~43#1;havoc main_~node6__m6~30#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10882: havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~105#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9561: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9165: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6128: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~54#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10224: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~98#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7846: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4279: havoc main_~node3__m3~5#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3619: havoc main_~node6__m6~20#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4544: havoc main_~node5__m5~15#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10358: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~99#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4018: havoc main_~check__tmp~37#1;havoc main_~node6__m6~23#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9700: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~92#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7322: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2301: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9304: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~88#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4945: havoc main_~node5__m5~17#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1774: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9042: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~85#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2040: havoc main_~check__tmp~15#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6929: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1645: havoc main_~node4__m4~3#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8384: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~78#1; [2025-03-03 15:15:45,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-03 15:15:45,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10102: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-03 15:15:45,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3761: havoc main_~check__tmp~34#1;havoc main_~node6__m6~21#1; [2025-03-03 15:15:45,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7726: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~71#1; [2025-03-03 15:15:45,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9578: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-03 15:15:45,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6539: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-03 15:15:45,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7068: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~64#1; [2025-03-03 15:15:45,148 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9182: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4294: havoc main_~node4__m4~8#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L860: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6806: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~61#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6410: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~57#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8262: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L995: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5752: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~50#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4960: havoc main_~node6__m6~32#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8792: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5886: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~51#1; [2025-03-03 15:15:45,149 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9982: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~95#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2849: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1660: havoc main_~node5__m5~4#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5228: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~44#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6946: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1398: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8666: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~81#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1532: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10649: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4176: havoc main_~node6__m6~25#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5630: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7612: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~70#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4309: havoc main_~node5__m5~14#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6556: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8142: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~75#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3914: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~35#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10788: havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~104#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1276: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10526: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~101#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8809: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1675: havoc main_~node6__m6~6#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3657: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~32#1; [2025-03-03 15:15:45,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9868: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~94#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7490: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9472: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~90#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2470: havoc main_~check__tmp~20#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5510: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~47#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4586: havoc main_~check__tmp~42#1;havoc main_~node6__m6~28#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L491: havoc main_~node2__m2~1#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134: havoc main_~node6__m6~17#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8948: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~84#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10666: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2210: havoc main_~node3__m3~3#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4324: havoc main_~node6__m6~26#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: havoc main_~node2__m2~3#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8026: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7894: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~73#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6573: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6177: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: havoc main_~node6__m6~7#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1950: havoc main_~node5__m5~5#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9746: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: havoc main_~node2__m2~2#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7236: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~66#1; [2025-03-03 15:15:45,151 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9350: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-03 15:15:45,380 INFO L? ?]: Removed 1124 outVars from TransFormulas that were not future-live. [2025-03-03 15:15:45,380 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:15:45,415 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:15:45,415 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:15:45,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:45 BoogieIcfgContainer [2025-03-03 15:15:45,416 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:15:45,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:15:45,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:15:45,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:15:45,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:15:40" (1/3) ... [2025-03-03 15:15:45,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b12a4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:45, skipping insertion in model container [2025-03-03 15:15:45,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:15:41" (2/3) ... [2025-03-03 15:15:45,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b12a4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:15:45, skipping insertion in model container [2025-03-03 15:15:45,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:15:45" (3/3) ... [2025-03-03 15:15:45,425 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2025-03-03 15:15:45,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:15:45,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c that has 1 procedures, 1131 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-03 15:15:45,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:15:45,514 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;@164f5ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:15:45,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-03 15:15:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 1131 states, 1108 states have (on average 1.855595667870036) internal successors, (2056), 1130 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:15:45,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:45,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:45,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:45,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash -39771553, now seen corresponding path program 1 times [2025-03-03 15:15:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:45,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716905347] [2025-03-03 15:15:45,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:45,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:45,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:15:45,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:15:45,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:45,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716905347] [2025-03-03 15:15:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716905347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:46,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:46,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066180566] [2025-03-03 15:15:46,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:46,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:46,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:46,147 INFO L87 Difference]: Start difference. First operand has 1131 states, 1108 states have (on average 1.855595667870036) internal successors, (2056), 1130 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:46,769 INFO L93 Difference]: Finished difference Result 1715 states and 3012 transitions. [2025-03-03 15:15:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-03 15:15:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:46,784 INFO L225 Difference]: With dead ends: 1715 [2025-03-03 15:15:46,784 INFO L226 Difference]: Without dead ends: 896 [2025-03-03 15:15:46,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:46,797 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 4561 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:46,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 1089 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-03 15:15:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2025-03-03 15:15:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 874 states have (on average 1.3100686498855836) internal successors, (1145), 895 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1145 transitions. [2025-03-03 15:15:46,868 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1145 transitions. Word has length 86 [2025-03-03 15:15:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:46,868 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1145 transitions. [2025-03-03 15:15:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1145 transitions. [2025-03-03 15:15:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:15:46,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:46,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:46,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:15:46,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:46,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash 69278776, now seen corresponding path program 1 times [2025-03-03 15:15:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38063156] [2025-03-03 15:15:46,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:46,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:15:46,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:15:46,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:46,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:47,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:47,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38063156] [2025-03-03 15:15:47,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38063156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:47,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:47,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:47,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590821767] [2025-03-03 15:15:47,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:47,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:47,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:47,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:47,095 INFO L87 Difference]: Start difference. First operand 896 states and 1145 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:47,645 INFO L93 Difference]: Finished difference Result 1819 states and 2410 transitions. [2025-03-03 15:15:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:15:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:47,649 INFO L225 Difference]: With dead ends: 1819 [2025-03-03 15:15:47,649 INFO L226 Difference]: Without dead ends: 1107 [2025-03-03 15:15:47,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:47,650 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 3860 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3860 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:47,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3860 Valid, 845 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:15:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-03 15:15:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1027. [2025-03-03 15:15:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1005 states have (on average 1.3890547263681592) internal successors, (1396), 1026 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1396 transitions. [2025-03-03 15:15:47,668 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1396 transitions. Word has length 87 [2025-03-03 15:15:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:47,668 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1396 transitions. [2025-03-03 15:15:47,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1396 transitions. [2025-03-03 15:15:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:15:47,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:47,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:47,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:15:47,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:47,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash -268723849, now seen corresponding path program 1 times [2025-03-03 15:15:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:47,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077664797] [2025-03-03 15:15:47,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:47,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:47,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:15:47,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:15:47,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:47,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:47,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077664797] [2025-03-03 15:15:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077664797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:47,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738781248] [2025-03-03 15:15:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:47,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:47,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:47,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:47,837 INFO L87 Difference]: Start difference. First operand 1027 states and 1396 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:48,226 INFO L93 Difference]: Finished difference Result 1870 states and 2593 transitions. [2025-03-03 15:15:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 15:15:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:48,230 INFO L225 Difference]: With dead ends: 1870 [2025-03-03 15:15:48,230 INFO L226 Difference]: Without dead ends: 960 [2025-03-03 15:15:48,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:48,234 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 2681 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:48,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 534 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-03 15:15:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2025-03-03 15:15:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 938 states have (on average 1.4061833688699361) internal successors, (1319), 959 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1319 transitions. [2025-03-03 15:15:48,257 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1319 transitions. Word has length 88 [2025-03-03 15:15:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:48,258 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1319 transitions. [2025-03-03 15:15:48,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1319 transitions. [2025-03-03 15:15:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:15:48,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:48,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:48,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:15:48,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:48,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1858053616, now seen corresponding path program 1 times [2025-03-03 15:15:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956360835] [2025-03-03 15:15:48,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:48,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:15:48,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:15:48,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:48,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956360835] [2025-03-03 15:15:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956360835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:48,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500808178] [2025-03-03 15:15:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:48,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:48,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:48,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:48,447 INFO L87 Difference]: Start difference. First operand 960 states and 1319 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:48,881 INFO L93 Difference]: Finished difference Result 1803 states and 2514 transitions. [2025-03-03 15:15:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 15:15:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:48,884 INFO L225 Difference]: With dead ends: 1803 [2025-03-03 15:15:48,884 INFO L226 Difference]: Without dead ends: 940 [2025-03-03 15:15:48,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:48,886 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 2534 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:48,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 446 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:15:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-03 15:15:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2025-03-03 15:15:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 918 states have (on average 1.408496732026144) internal successors, (1293), 939 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1293 transitions. [2025-03-03 15:15:48,899 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1293 transitions. Word has length 89 [2025-03-03 15:15:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:48,899 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1293 transitions. [2025-03-03 15:15:48,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1293 transitions. [2025-03-03 15:15:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:15:48,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:48,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:48,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:15:48,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:48,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1868455409, now seen corresponding path program 1 times [2025-03-03 15:15:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747152314] [2025-03-03 15:15:48,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:48,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:48,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:15:48,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:15:48,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:48,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747152314] [2025-03-03 15:15:49,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747152314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:49,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:49,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792084799] [2025-03-03 15:15:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:49,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:49,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:49,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:49,028 INFO L87 Difference]: Start difference. First operand 940 states and 1293 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:49,356 INFO L93 Difference]: Finished difference Result 1783 states and 2486 transitions. [2025-03-03 15:15:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:49,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:15:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:49,359 INFO L225 Difference]: With dead ends: 1783 [2025-03-03 15:15:49,360 INFO L226 Difference]: Without dead ends: 918 [2025-03-03 15:15:49,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:49,362 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 2518 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:49,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 502 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-03 15:15:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2025-03-03 15:15:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.4140625) internal successors, (1267), 917 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1267 transitions. [2025-03-03 15:15:49,380 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1267 transitions. Word has length 90 [2025-03-03 15:15:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:49,381 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1267 transitions. [2025-03-03 15:15:49,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1267 transitions. [2025-03-03 15:15:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:15:49,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:49,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:49,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:15:49,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:49,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2057995368, now seen corresponding path program 1 times [2025-03-03 15:15:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098830626] [2025-03-03 15:15:49,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:49,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:15:49,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:15:49,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:49,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098830626] [2025-03-03 15:15:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098830626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:49,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:15:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137834631] [2025-03-03 15:15:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:49,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:15:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:49,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:15:49,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:15:49,504 INFO L87 Difference]: Start difference. First operand 918 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:49,855 INFO L93 Difference]: Finished difference Result 1761 states and 2458 transitions. [2025-03-03 15:15:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:15:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-03 15:15:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:49,858 INFO L225 Difference]: With dead ends: 1761 [2025-03-03 15:15:49,858 INFO L226 Difference]: Without dead ends: 910 [2025-03-03 15:15:49,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:15:49,859 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 2454 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2454 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:49,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2454 Valid, 476 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:15:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-03 15:15:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2025-03-03 15:15:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.4144144144144144) internal successors, (1256), 909 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1256 transitions. [2025-03-03 15:15:49,873 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1256 transitions. Word has length 91 [2025-03-03 15:15:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:49,873 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1256 transitions. [2025-03-03 15:15:49,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1256 transitions. [2025-03-03 15:15:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:15:49,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:49,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:49,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:15:49,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:49,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash -197132569, now seen corresponding path program 1 times [2025-03-03 15:15:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:49,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080101050] [2025-03-03 15:15:49,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:49,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:15:49,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:15:49,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:49,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080101050] [2025-03-03 15:15:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080101050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:50,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:50,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:15:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191723585] [2025-03-03 15:15:50,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:50,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:15:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:50,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:15:50,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:15:50,299 INFO L87 Difference]: Start difference. First operand 910 states and 1256 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:51,341 INFO L93 Difference]: Finished difference Result 1659 states and 2288 transitions. [2025-03-03 15:15:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:15:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:51,344 INFO L225 Difference]: With dead ends: 1659 [2025-03-03 15:15:51,344 INFO L226 Difference]: Without dead ends: 1257 [2025-03-03 15:15:51,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:15:51,347 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 2317 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 2028 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:51,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2317 Valid, 2544 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2028 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:15:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-03-03 15:15:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 910. [2025-03-03 15:15:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.412162162162162) internal successors, (1254), 909 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1254 transitions. [2025-03-03 15:15:51,362 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1254 transitions. Word has length 92 [2025-03-03 15:15:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:51,362 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1254 transitions. [2025-03-03 15:15:51,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1254 transitions. [2025-03-03 15:15:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:15:51,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:51,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:51,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:15:51,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:51,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 914522256, now seen corresponding path program 1 times [2025-03-03 15:15:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:51,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186152071] [2025-03-03 15:15:51,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:51,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:15:51,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:15:51,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:51,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:51,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186152071] [2025-03-03 15:15:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186152071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:51,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:15:51,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954656655] [2025-03-03 15:15:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:51,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:15:51,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:51,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:15:51,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:15:51,658 INFO L87 Difference]: Start difference. First operand 910 states and 1254 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:52,517 INFO L93 Difference]: Finished difference Result 1659 states and 2224 transitions. [2025-03-03 15:15:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:15:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:15:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:52,521 INFO L225 Difference]: With dead ends: 1659 [2025-03-03 15:15:52,521 INFO L226 Difference]: Without dead ends: 1239 [2025-03-03 15:15:52,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:15:52,522 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 3467 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3467 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:52,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3467 Valid, 1764 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:15:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-03 15:15:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 910. [2025-03-03 15:15:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.4110360360360361) internal successors, (1253), 909 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1253 transitions. [2025-03-03 15:15:52,537 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1253 transitions. Word has length 92 [2025-03-03 15:15:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:52,537 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1253 transitions. [2025-03-03 15:15:52,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1253 transitions. [2025-03-03 15:15:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:15:52,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:52,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:52,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:15:52,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:52,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1915090164, now seen corresponding path program 1 times [2025-03-03 15:15:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457733071] [2025-03-03 15:15:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:52,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:15:52,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:15:52,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:52,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:52,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457733071] [2025-03-03 15:15:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457733071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:52,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:52,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:52,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20054970] [2025-03-03 15:15:52,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:52,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:52,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:52,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:52,838 INFO L87 Difference]: Start difference. First operand 910 states and 1253 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:53,828 INFO L93 Difference]: Finished difference Result 1636 states and 2279 transitions. [2025-03-03 15:15:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:53,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:15:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:53,832 INFO L225 Difference]: With dead ends: 1636 [2025-03-03 15:15:53,832 INFO L226 Difference]: Without dead ends: 1438 [2025-03-03 15:15:53,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:15:53,835 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 3715 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3715 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:53,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3715 Valid, 3111 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:15:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-03-03 15:15:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 910. [2025-03-03 15:15:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.40990990990991) internal successors, (1252), 909 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1252 transitions. [2025-03-03 15:15:53,852 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1252 transitions. Word has length 92 [2025-03-03 15:15:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:53,852 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1252 transitions. [2025-03-03 15:15:53,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1252 transitions. [2025-03-03 15:15:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:15:53,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:53,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:53,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:15:53,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:53,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash -284718186, now seen corresponding path program 1 times [2025-03-03 15:15:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:53,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027169577] [2025-03-03 15:15:53,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:53,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:53,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:15:53,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:15:53,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:53,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:54,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:54,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027169577] [2025-03-03 15:15:54,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027169577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:54,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:54,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:54,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874638044] [2025-03-03 15:15:54,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:54,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:54,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:54,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:54,136 INFO L87 Difference]: Start difference. First operand 910 states and 1252 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:54,912 INFO L93 Difference]: Finished difference Result 1256 states and 1749 transitions. [2025-03-03 15:15:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:15:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:54,915 INFO L225 Difference]: With dead ends: 1256 [2025-03-03 15:15:54,915 INFO L226 Difference]: Without dead ends: 989 [2025-03-03 15:15:54,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:15:54,916 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 2470 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2470 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:54,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2470 Valid, 2647 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:15:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-03 15:15:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 910. [2025-03-03 15:15:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.4087837837837838) internal successors, (1251), 909 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1251 transitions. [2025-03-03 15:15:54,928 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1251 transitions. Word has length 92 [2025-03-03 15:15:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:54,928 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1251 transitions. [2025-03-03 15:15:54,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1251 transitions. [2025-03-03 15:15:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:15:54,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:54,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:15:54,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash -357558250, now seen corresponding path program 1 times [2025-03-03 15:15:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963518777] [2025-03-03 15:15:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:54,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:15:54,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:15:54,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:54,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:55,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:55,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963518777] [2025-03-03 15:15:55,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963518777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:55,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:55,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:55,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343885498] [2025-03-03 15:15:55,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:55,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:55,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:55,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:55,337 INFO L87 Difference]: Start difference. First operand 910 states and 1251 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:56,879 INFO L93 Difference]: Finished difference Result 2262 states and 3191 transitions. [2025-03-03 15:15:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:15:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:15:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:56,885 INFO L225 Difference]: With dead ends: 2262 [2025-03-03 15:15:56,885 INFO L226 Difference]: Without dead ends: 2050 [2025-03-03 15:15:56,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:15:56,887 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 6331 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 4079 SdHoareTripleChecker+Invalid, 3502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:56,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 4079 Invalid, 3502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:15:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-03-03 15:15:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 914. [2025-03-03 15:15:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 892 states have (on average 1.40695067264574) internal successors, (1255), 913 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1255 transitions. [2025-03-03 15:15:56,905 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1255 transitions. Word has length 94 [2025-03-03 15:15:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:56,906 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1255 transitions. [2025-03-03 15:15:56,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1255 transitions. [2025-03-03 15:15:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:15:56,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:56,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:56,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:15:56,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 901655269, now seen corresponding path program 1 times [2025-03-03 15:15:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427492997] [2025-03-03 15:15:56,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:15:56,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:15:56,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:56,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:57,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:57,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427492997] [2025-03-03 15:15:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427492997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:57,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746717932] [2025-03-03 15:15:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:57,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:57,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:57,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:57,185 INFO L87 Difference]: Start difference. First operand 914 states and 1255 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:58,006 INFO L93 Difference]: Finished difference Result 1587 states and 2198 transitions. [2025-03-03 15:15:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:15:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:15:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:58,010 INFO L225 Difference]: With dead ends: 1587 [2025-03-03 15:15:58,010 INFO L226 Difference]: Without dead ends: 1414 [2025-03-03 15:15:58,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:15:58,010 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 2985 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2985 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:58,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2985 Valid, 2747 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:15:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-03 15:15:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 914. [2025-03-03 15:15:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 892 states have (on average 1.405829596412556) internal successors, (1254), 913 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1254 transitions. [2025-03-03 15:15:58,023 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1254 transitions. Word has length 94 [2025-03-03 15:15:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:58,023 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1254 transitions. [2025-03-03 15:15:58,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1254 transitions. [2025-03-03 15:15:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:15:58,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:58,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:58,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:15:58,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:58,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash 55491476, now seen corresponding path program 1 times [2025-03-03 15:15:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:58,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802493560] [2025-03-03 15:15:58,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:58,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:15:58,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:15:58,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:58,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:58,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802493560] [2025-03-03 15:15:58,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802493560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:58,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:58,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:15:58,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950313882] [2025-03-03 15:15:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:58,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:15:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:58,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:15:58,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:15:58,401 INFO L87 Difference]: Start difference. First operand 914 states and 1254 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:15:59,550 INFO L93 Difference]: Finished difference Result 2119 states and 2976 transitions. [2025-03-03 15:15:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:15:59,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:15:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:15:59,554 INFO L225 Difference]: With dead ends: 2119 [2025-03-03 15:15:59,555 INFO L226 Difference]: Without dead ends: 1946 [2025-03-03 15:15:59,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:15:59,556 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 6703 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6703 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:15:59,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6703 Valid, 2463 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:15:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2025-03-03 15:15:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 918. [2025-03-03 15:15:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.4040178571428572) internal successors, (1258), 917 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1258 transitions. [2025-03-03 15:15:59,581 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1258 transitions. Word has length 94 [2025-03-03 15:15:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:15:59,581 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1258 transitions. [2025-03-03 15:15:59,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:15:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1258 transitions. [2025-03-03 15:15:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:15:59,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:15:59,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:15:59,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:15:59,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:15:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:15:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 837475690, now seen corresponding path program 1 times [2025-03-03 15:15:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:15:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098777420] [2025-03-03 15:15:59,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:15:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:15:59,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:15:59,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:15:59,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:15:59,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:15:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:15:59,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:15:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098777420] [2025-03-03 15:15:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098777420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:15:59,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:15:59,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:15:59,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389569168] [2025-03-03 15:15:59,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:15:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:15:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:15:59,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:15:59,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:15:59,796 INFO L87 Difference]: Start difference. First operand 918 states and 1258 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:00,575 INFO L93 Difference]: Finished difference Result 1582 states and 2191 transitions. [2025-03-03 15:16:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:00,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:16:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:00,578 INFO L225 Difference]: With dead ends: 1582 [2025-03-03 15:16:00,578 INFO L226 Difference]: Without dead ends: 1414 [2025-03-03 15:16:00,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:00,579 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 4672 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:00,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 2154 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-03 15:16:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-03 15:16:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.4029017857142858) internal successors, (1257), 917 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1257 transitions. [2025-03-03 15:16:00,591 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1257 transitions. Word has length 94 [2025-03-03 15:16:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:00,591 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1257 transitions. [2025-03-03 15:16:00,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1257 transitions. [2025-03-03 15:16:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:16:00,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:00,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:00,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:16:00,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:00,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1831608880, now seen corresponding path program 1 times [2025-03-03 15:16:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:00,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146898312] [2025-03-03 15:16:00,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:00,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:00,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:16:00,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:16:00,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:00,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:00,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146898312] [2025-03-03 15:16:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146898312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:00,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180745577] [2025-03-03 15:16:00,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:00,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:00,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:00,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:00,815 INFO L87 Difference]: Start difference. First operand 918 states and 1257 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:01,719 INFO L93 Difference]: Finished difference Result 1688 states and 2340 transitions. [2025-03-03 15:16:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:01,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:16:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:01,722 INFO L225 Difference]: With dead ends: 1688 [2025-03-03 15:16:01,722 INFO L226 Difference]: Without dead ends: 1442 [2025-03-03 15:16:01,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:01,723 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 3613 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3613 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:01,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3613 Valid, 3299 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-03 15:16:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 918. [2025-03-03 15:16:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.4006696428571428) internal successors, (1255), 917 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1255 transitions. [2025-03-03 15:16:01,732 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1255 transitions. Word has length 94 [2025-03-03 15:16:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:01,732 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1255 transitions. [2025-03-03 15:16:01,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1255 transitions. [2025-03-03 15:16:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:16:01,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:01,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:01,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:16:01,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:01,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash -572395361, now seen corresponding path program 1 times [2025-03-03 15:16:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:01,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444042707] [2025-03-03 15:16:01,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:01,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:16:01,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:16:01,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:01,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:01,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444042707] [2025-03-03 15:16:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444042707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:01,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:01,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489150948] [2025-03-03 15:16:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:01,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:01,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:01,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:01,922 INFO L87 Difference]: Start difference. First operand 918 states and 1255 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:02,697 INFO L93 Difference]: Finished difference Result 1606 states and 2220 transitions. [2025-03-03 15:16:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:02,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:16:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:02,701 INFO L225 Difference]: With dead ends: 1606 [2025-03-03 15:16:02,701 INFO L226 Difference]: Without dead ends: 1414 [2025-03-03 15:16:02,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:02,702 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 2926 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2926 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:02,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2926 Valid, 2859 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-03 15:16:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-03 15:16:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3984375) internal successors, (1253), 917 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1253 transitions. [2025-03-03 15:16:02,711 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1253 transitions. Word has length 94 [2025-03-03 15:16:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:02,711 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1253 transitions. [2025-03-03 15:16:02,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1253 transitions. [2025-03-03 15:16:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:02,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:02,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:02,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:16:02,713 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:02,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:02,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1466825864, now seen corresponding path program 1 times [2025-03-03 15:16:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410407654] [2025-03-03 15:16:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:02,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:02,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:02,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:02,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410407654] [2025-03-03 15:16:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410407654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116415596] [2025-03-03 15:16:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:02,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:02,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:02,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:02,898 INFO L87 Difference]: Start difference. First operand 918 states and 1253 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:03,586 INFO L93 Difference]: Finished difference Result 1351 states and 1820 transitions. [2025-03-03 15:16:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:03,589 INFO L225 Difference]: With dead ends: 1351 [2025-03-03 15:16:03,589 INFO L226 Difference]: Without dead ends: 1346 [2025-03-03 15:16:03,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:03,590 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 3470 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3470 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:03,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3470 Valid, 1889 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-03 15:16:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 918. [2025-03-03 15:16:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3973214285714286) internal successors, (1252), 917 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1252 transitions. [2025-03-03 15:16:03,600 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1252 transitions. Word has length 95 [2025-03-03 15:16:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1252 transitions. [2025-03-03 15:16:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1252 transitions. [2025-03-03 15:16:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:03,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:03,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:03,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:16:03,601 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:03,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2034222567, now seen corresponding path program 1 times [2025-03-03 15:16:03,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:03,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598899778] [2025-03-03 15:16:03,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:03,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:03,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:03,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:03,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:03,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:03,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:03,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598899778] [2025-03-03 15:16:03,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598899778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:03,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800960759] [2025-03-03 15:16:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:03,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:03,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:03,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:03,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:03,763 INFO L87 Difference]: Start difference. First operand 918 states and 1252 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:04,606 INFO L93 Difference]: Finished difference Result 1654 states and 2286 transitions. [2025-03-03 15:16:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:04,609 INFO L225 Difference]: With dead ends: 1654 [2025-03-03 15:16:04,609 INFO L226 Difference]: Without dead ends: 1442 [2025-03-03 15:16:04,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:04,610 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 2595 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2595 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:04,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2595 Valid, 3121 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-03 15:16:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 914. [2025-03-03 15:16:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 892 states have (on average 1.397982062780269) internal successors, (1247), 913 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1247 transitions. [2025-03-03 15:16:04,619 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1247 transitions. Word has length 95 [2025-03-03 15:16:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1247 transitions. [2025-03-03 15:16:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1247 transitions. [2025-03-03 15:16:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:04,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:04,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:04,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:16:04,622 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:04,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash -383543387, now seen corresponding path program 1 times [2025-03-03 15:16:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:04,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097478063] [2025-03-03 15:16:04,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:04,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:04,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:04,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:04,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097478063] [2025-03-03 15:16:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097478063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405955705] [2025-03-03 15:16:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:04,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:04,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:04,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:04,924 INFO L87 Difference]: Start difference. First operand 914 states and 1247 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:06,047 INFO L93 Difference]: Finished difference Result 2002 states and 2788 transitions. [2025-03-03 15:16:06,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:06,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:06,051 INFO L225 Difference]: With dead ends: 2002 [2025-03-03 15:16:06,051 INFO L226 Difference]: Without dead ends: 1842 [2025-03-03 15:16:06,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:06,052 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 6531 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6531 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:06,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6531 Valid, 2421 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:16:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-03 15:16:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 918. [2025-03-03 15:16:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3962053571428572) internal successors, (1251), 917 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1251 transitions. [2025-03-03 15:16:06,061 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1251 transitions. Word has length 96 [2025-03-03 15:16:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:06,062 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1251 transitions. [2025-03-03 15:16:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1251 transitions. [2025-03-03 15:16:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:06,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:06,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:06,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:16:06,063 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:06,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 408333678, now seen corresponding path program 1 times [2025-03-03 15:16:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832439967] [2025-03-03 15:16:06,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:06,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832439967] [2025-03-03 15:16:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832439967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764039027] [2025-03-03 15:16:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:06,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:06,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:06,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:06,260 INFO L87 Difference]: Start difference. First operand 918 states and 1251 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:07,062 INFO L93 Difference]: Finished difference Result 1546 states and 2123 transitions. [2025-03-03 15:16:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:07,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:07,066 INFO L225 Difference]: With dead ends: 1546 [2025-03-03 15:16:07,069 INFO L226 Difference]: Without dead ends: 1390 [2025-03-03 15:16:07,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:07,071 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 3794 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3794 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:07,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3794 Valid, 2682 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-03 15:16:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-03 15:16:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3950892857142858) internal successors, (1250), 917 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1250 transitions. [2025-03-03 15:16:07,082 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1250 transitions. Word has length 96 [2025-03-03 15:16:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:07,082 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1250 transitions. [2025-03-03 15:16:07,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1250 transitions. [2025-03-03 15:16:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:07,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:07,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:16:07,084 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:07,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -603509994, now seen corresponding path program 1 times [2025-03-03 15:16:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:07,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969058824] [2025-03-03 15:16:07,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:07,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:07,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:07,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:07,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969058824] [2025-03-03 15:16:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969058824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160531457] [2025-03-03 15:16:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:07,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:07,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:07,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:07,259 INFO L87 Difference]: Start difference. First operand 918 states and 1250 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:08,031 INFO L93 Difference]: Finished difference Result 1596 states and 2195 transitions. [2025-03-03 15:16:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:08,035 INFO L225 Difference]: With dead ends: 1596 [2025-03-03 15:16:08,035 INFO L226 Difference]: Without dead ends: 1414 [2025-03-03 15:16:08,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:08,036 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 3799 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3799 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:08,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3799 Valid, 2717 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-03 15:16:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-03 15:16:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3939732142857142) internal successors, (1249), 917 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1249 transitions. [2025-03-03 15:16:08,047 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1249 transitions. Word has length 96 [2025-03-03 15:16:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1249 transitions. [2025-03-03 15:16:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1249 transitions. [2025-03-03 15:16:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:08,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:08,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:16:08,048 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:08,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash -377088797, now seen corresponding path program 1 times [2025-03-03 15:16:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854462776] [2025-03-03 15:16:08,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:08,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:08,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:08,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:08,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:08,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:08,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854462776] [2025-03-03 15:16:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854462776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:08,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:08,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940109677] [2025-03-03 15:16:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:08,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:08,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:08,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:08,232 INFO L87 Difference]: Start difference. First operand 918 states and 1249 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:08,983 INFO L93 Difference]: Finished difference Result 1550 states and 2125 transitions. [2025-03-03 15:16:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:08,986 INFO L225 Difference]: With dead ends: 1550 [2025-03-03 15:16:08,986 INFO L226 Difference]: Without dead ends: 1390 [2025-03-03 15:16:08,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:08,988 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 3741 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3741 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:08,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3741 Valid, 2786 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-03 15:16:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-03 15:16:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3928571428571428) internal successors, (1248), 917 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1248 transitions. [2025-03-03 15:16:08,996 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1248 transitions. Word has length 96 [2025-03-03 15:16:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:08,997 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1248 transitions. [2025-03-03 15:16:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1248 transitions. [2025-03-03 15:16:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:08,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:08,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:08,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:16:08,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:08,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1006391796, now seen corresponding path program 1 times [2025-03-03 15:16:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264074557] [2025-03-03 15:16:08,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:09,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:09,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:09,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:09,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264074557] [2025-03-03 15:16:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264074557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389563624] [2025-03-03 15:16:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:09,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:09,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:09,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:09,156 INFO L87 Difference]: Start difference. First operand 918 states and 1248 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:09,867 INFO L93 Difference]: Finished difference Result 1546 states and 2120 transitions. [2025-03-03 15:16:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:09,870 INFO L225 Difference]: With dead ends: 1546 [2025-03-03 15:16:09,870 INFO L226 Difference]: Without dead ends: 1390 [2025-03-03 15:16:09,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:09,871 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1990 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:09,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1990 Valid, 2493 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-03 15:16:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-03 15:16:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3917410714285714) internal successors, (1247), 917 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1247 transitions. [2025-03-03 15:16:09,892 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1247 transitions. Word has length 96 [2025-03-03 15:16:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:09,893 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1247 transitions. [2025-03-03 15:16:09,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1247 transitions. [2025-03-03 15:16:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:09,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:09,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:09,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:16:09,894 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:09,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1108277290, now seen corresponding path program 1 times [2025-03-03 15:16:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446164888] [2025-03-03 15:16:09,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:09,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:09,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:10,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:10,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446164888] [2025-03-03 15:16:10,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446164888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:10,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:10,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759123969] [2025-03-03 15:16:10,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:10,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:10,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:10,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:10,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:10,122 INFO L87 Difference]: Start difference. First operand 918 states and 1247 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:10,908 INFO L93 Difference]: Finished difference Result 1546 states and 2119 transitions. [2025-03-03 15:16:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:10,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:10,910 INFO L225 Difference]: With dead ends: 1546 [2025-03-03 15:16:10,910 INFO L226 Difference]: Without dead ends: 1390 [2025-03-03 15:16:10,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:10,911 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 2917 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2917 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:10,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2917 Valid, 2771 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-03 15:16:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-03 15:16:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.390625) internal successors, (1246), 917 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1246 transitions. [2025-03-03 15:16:10,919 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1246 transitions. Word has length 96 [2025-03-03 15:16:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:10,919 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1246 transitions. [2025-03-03 15:16:10,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1246 transitions. [2025-03-03 15:16:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:10,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:10,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:10,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:16:10,920 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:10,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1269274821, now seen corresponding path program 1 times [2025-03-03 15:16:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047872776] [2025-03-03 15:16:10,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:10,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:10,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:10,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:10,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:11,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:11,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047872776] [2025-03-03 15:16:11,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047872776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:11,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:11,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871172147] [2025-03-03 15:16:11,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:11,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:11,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:11,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:11,081 INFO L87 Difference]: Start difference. First operand 918 states and 1246 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:11,715 INFO L93 Difference]: Finished difference Result 1494 states and 2028 transitions. [2025-03-03 15:16:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:11,715 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:11,717 INFO L225 Difference]: With dead ends: 1494 [2025-03-03 15:16:11,717 INFO L226 Difference]: Without dead ends: 1346 [2025-03-03 15:16:11,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:11,719 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 3342 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3342 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:11,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3342 Valid, 1984 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-03 15:16:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 918. [2025-03-03 15:16:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3895089285714286) internal successors, (1245), 917 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1245 transitions. [2025-03-03 15:16:11,726 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1245 transitions. Word has length 96 [2025-03-03 15:16:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:11,726 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1245 transitions. [2025-03-03 15:16:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1245 transitions. [2025-03-03 15:16:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:11,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:11,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:11,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:16:11,727 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 173031760, now seen corresponding path program 1 times [2025-03-03 15:16:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434841333] [2025-03-03 15:16:11,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:11,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:11,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:11,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:11,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434841333] [2025-03-03 15:16:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434841333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:11,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479980557] [2025-03-03 15:16:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:11,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:11,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:11,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:11,874 INFO L87 Difference]: Start difference. First operand 918 states and 1245 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:12,608 INFO L93 Difference]: Finished difference Result 1606 states and 2201 transitions. [2025-03-03 15:16:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:12,610 INFO L225 Difference]: With dead ends: 1606 [2025-03-03 15:16:12,610 INFO L226 Difference]: Without dead ends: 1414 [2025-03-03 15:16:12,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:12,611 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1966 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:12,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 2563 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-03 15:16:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-03 15:16:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3872767857142858) internal successors, (1243), 917 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1243 transitions. [2025-03-03 15:16:12,618 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1243 transitions. Word has length 96 [2025-03-03 15:16:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:12,618 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1243 transitions. [2025-03-03 15:16:12,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1243 transitions. [2025-03-03 15:16:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:12,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:12,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:12,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:16:12,619 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:12,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 399452957, now seen corresponding path program 1 times [2025-03-03 15:16:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033898228] [2025-03-03 15:16:12,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:12,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:12,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:12,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:12,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033898228] [2025-03-03 15:16:12,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033898228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:12,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:12,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052429077] [2025-03-03 15:16:12,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:12,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:12,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:12,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:12,788 INFO L87 Difference]: Start difference. First operand 918 states and 1243 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:13,447 INFO L93 Difference]: Finished difference Result 1556 states and 2126 transitions. [2025-03-03 15:16:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:13,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:13,449 INFO L225 Difference]: With dead ends: 1556 [2025-03-03 15:16:13,449 INFO L226 Difference]: Without dead ends: 1390 [2025-03-03 15:16:13,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:13,449 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 3639 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3639 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:13,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3639 Valid, 2393 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-03 15:16:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-03 15:16:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3850446428571428) internal successors, (1241), 917 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1241 transitions. [2025-03-03 15:16:13,456 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1241 transitions. Word has length 96 [2025-03-03 15:16:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1241 transitions. [2025-03-03 15:16:13,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1241 transitions. [2025-03-03 15:16:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:13,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:13,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:13,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:16:13,457 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:13,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash 392998367, now seen corresponding path program 1 times [2025-03-03 15:16:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:13,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550332259] [2025-03-03 15:16:13,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:13,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:13,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:13,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:13,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:13,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:13,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550332259] [2025-03-03 15:16:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550332259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:13,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903305121] [2025-03-03 15:16:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:13,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:13,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:13,730 INFO L87 Difference]: Start difference. First operand 918 states and 1241 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:14,814 INFO L93 Difference]: Finished difference Result 2008 states and 2784 transitions. [2025-03-03 15:16:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:14,817 INFO L225 Difference]: With dead ends: 2008 [2025-03-03 15:16:14,817 INFO L226 Difference]: Without dead ends: 1842 [2025-03-03 15:16:14,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:14,818 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 7583 mSDsluCounter, 2261 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7583 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:14,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7583 Valid, 2817 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-03 15:16:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 926. [2025-03-03 15:16:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3816371681415929) internal successors, (1249), 925 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1249 transitions. [2025-03-03 15:16:14,827 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1249 transitions. Word has length 96 [2025-03-03 15:16:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:14,827 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1249 transitions. [2025-03-03 15:16:14,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1249 transitions. [2025-03-03 15:16:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:14,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:14,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:14,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:16:14,828 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:14,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1185201136, now seen corresponding path program 1 times [2025-03-03 15:16:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797308977] [2025-03-03 15:16:14,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:14,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:14,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:14,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:14,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797308977] [2025-03-03 15:16:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797308977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807958148] [2025-03-03 15:16:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:14,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:14,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:14,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:14,991 INFO L87 Difference]: Start difference. First operand 926 states and 1249 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:15,597 INFO L93 Difference]: Finished difference Result 1506 states and 2034 transitions. [2025-03-03 15:16:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:15,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:15,599 INFO L225 Difference]: With dead ends: 1506 [2025-03-03 15:16:15,599 INFO L226 Difference]: Without dead ends: 1354 [2025-03-03 15:16:15,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:15,600 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 3299 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3299 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:15,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3299 Valid, 2021 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-03 15:16:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 926. [2025-03-03 15:16:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3794247787610618) internal successors, (1247), 925 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1247 transitions. [2025-03-03 15:16:15,607 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1247 transitions. Word has length 96 [2025-03-03 15:16:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1247 transitions. [2025-03-03 15:16:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1247 transitions. [2025-03-03 15:16:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:15,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:15,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:15,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:16:15,608 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:15,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash -991121145, now seen corresponding path program 1 times [2025-03-03 15:16:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:15,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825037486] [2025-03-03 15:16:15,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:15,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:15,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:15,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:15,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825037486] [2025-03-03 15:16:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825037486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964990716] [2025-03-03 15:16:15,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:15,890 INFO L87 Difference]: Start difference. First operand 926 states and 1247 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:17,083 INFO L93 Difference]: Finished difference Result 2348 states and 3274 transitions. [2025-03-03 15:16:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:17,087 INFO L225 Difference]: With dead ends: 2348 [2025-03-03 15:16:17,087 INFO L226 Difference]: Without dead ends: 2070 [2025-03-03 15:16:17,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:17,088 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 6341 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6341 SdHoareTripleChecker+Valid, 3353 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:17,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6341 Valid, 3353 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:16:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2025-03-03 15:16:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 934. [2025-03-03 15:16:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3760964912280702) internal successors, (1255), 933 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1255 transitions. [2025-03-03 15:16:17,100 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1255 transitions. Word has length 96 [2025-03-03 15:16:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:17,100 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1255 transitions. [2025-03-03 15:16:17,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1255 transitions. [2025-03-03 15:16:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:17,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:17,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:17,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:16:17,102 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:17,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1411014962, now seen corresponding path program 1 times [2025-03-03 15:16:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931747943] [2025-03-03 15:16:17,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:17,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:17,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:17,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:17,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931747943] [2025-03-03 15:16:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931747943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386585084] [2025-03-03 15:16:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:17,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:17,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:17,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:17,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:17,286 INFO L87 Difference]: Start difference. First operand 934 states and 1255 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:17,954 INFO L93 Difference]: Finished difference Result 1634 states and 2226 transitions. [2025-03-03 15:16:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:17,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:17,957 INFO L225 Difference]: With dead ends: 1634 [2025-03-03 15:16:17,957 INFO L226 Difference]: Without dead ends: 1430 [2025-03-03 15:16:17,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:17,958 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 4076 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4076 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:17,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4076 Valid, 2578 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-03-03 15:16:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 934. [2025-03-03 15:16:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3739035087719298) internal successors, (1253), 933 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1253 transitions. [2025-03-03 15:16:17,965 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1253 transitions. Word has length 96 [2025-03-03 15:16:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:17,965 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1253 transitions. [2025-03-03 15:16:17,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1253 transitions. [2025-03-03 15:16:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:17,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:17,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:17,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:16:17,966 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:17,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1184593765, now seen corresponding path program 1 times [2025-03-03 15:16:17,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:17,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134224879] [2025-03-03 15:16:17,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:17,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:17,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:17,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:17,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:17,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:18,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134224879] [2025-03-03 15:16:18,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134224879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:18,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:18,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397187206] [2025-03-03 15:16:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:18,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:18,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:18,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:18,115 INFO L87 Difference]: Start difference. First operand 934 states and 1253 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:18,806 INFO L93 Difference]: Finished difference Result 1568 states and 2132 transitions. [2025-03-03 15:16:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:18,808 INFO L225 Difference]: With dead ends: 1568 [2025-03-03 15:16:18,808 INFO L226 Difference]: Without dead ends: 1398 [2025-03-03 15:16:18,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:18,809 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 2826 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2826 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:18,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2826 Valid, 2711 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-03 15:16:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 934. [2025-03-03 15:16:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3717105263157894) internal successors, (1251), 933 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1251 transitions. [2025-03-03 15:16:18,819 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1251 transitions. Word has length 96 [2025-03-03 15:16:18,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:18,819 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1251 transitions. [2025-03-03 15:16:18,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1251 transitions. [2025-03-03 15:16:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:18,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:18,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:18,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:16:18,820 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:18,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:18,821 INFO L85 PathProgramCache]: Analyzing trace with hash 574671180, now seen corresponding path program 1 times [2025-03-03 15:16:18,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:18,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59380862] [2025-03-03 15:16:18,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:18,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:18,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:18,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:18,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:18,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59380862] [2025-03-03 15:16:18,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59380862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:18,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:18,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466378410] [2025-03-03 15:16:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:18,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:18,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:18,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:18,990 INFO L87 Difference]: Start difference. First operand 934 states and 1251 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:19,663 INFO L93 Difference]: Finished difference Result 1558 states and 2116 transitions. [2025-03-03 15:16:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:19,665 INFO L225 Difference]: With dead ends: 1558 [2025-03-03 15:16:19,665 INFO L226 Difference]: Without dead ends: 1398 [2025-03-03 15:16:19,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:19,666 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 3004 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3004 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:19,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3004 Valid, 2480 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-03 15:16:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 930. [2025-03-03 15:16:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 908 states have (on average 1.3722466960352422) internal successors, (1246), 929 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1246 transitions. [2025-03-03 15:16:19,673 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1246 transitions. Word has length 97 [2025-03-03 15:16:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:19,673 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1246 transitions. [2025-03-03 15:16:19,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1246 transitions. [2025-03-03 15:16:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:19,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:19,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:19,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:16:19,674 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:19,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2081182659, now seen corresponding path program 1 times [2025-03-03 15:16:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371575005] [2025-03-03 15:16:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:19,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:19,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:19,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:19,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371575005] [2025-03-03 15:16:19,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371575005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:19,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:19,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36732381] [2025-03-03 15:16:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:19,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:19,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:19,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:19,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:19,814 INFO L87 Difference]: Start difference. First operand 930 states and 1246 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:20,467 INFO L93 Difference]: Finished difference Result 1558 states and 2113 transitions. [2025-03-03 15:16:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:20,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:20,469 INFO L225 Difference]: With dead ends: 1558 [2025-03-03 15:16:20,469 INFO L226 Difference]: Without dead ends: 1398 [2025-03-03 15:16:20,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:20,470 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 3983 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3983 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:20,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3983 Valid, 2492 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-03 15:16:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 930. [2025-03-03 15:16:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 908 states have (on average 1.3711453744493391) internal successors, (1245), 929 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1245 transitions. [2025-03-03 15:16:20,479 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1245 transitions. Word has length 97 [2025-03-03 15:16:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:20,479 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1245 transitions. [2025-03-03 15:16:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1245 transitions. [2025-03-03 15:16:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:20,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:20,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:20,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:16:20,481 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:20,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash 698371265, now seen corresponding path program 1 times [2025-03-03 15:16:20,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:20,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98003964] [2025-03-03 15:16:20,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:20,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:20,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:20,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:20,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:20,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98003964] [2025-03-03 15:16:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98003964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:20,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912403281] [2025-03-03 15:16:20,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:20,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:20,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:20,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:20,655 INFO L87 Difference]: Start difference. First operand 930 states and 1245 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:21,388 INFO L93 Difference]: Finished difference Result 1599 states and 2171 transitions. [2025-03-03 15:16:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:21,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:21,390 INFO L225 Difference]: With dead ends: 1599 [2025-03-03 15:16:21,390 INFO L226 Difference]: Without dead ends: 1426 [2025-03-03 15:16:21,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:16:21,391 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 2947 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2947 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:21,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2947 Valid, 2631 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-03-03 15:16:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 926. [2025-03-03 15:16:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3716814159292035) internal successors, (1240), 925 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1240 transitions. [2025-03-03 15:16:21,400 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1240 transitions. Word has length 97 [2025-03-03 15:16:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:21,400 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1240 transitions. [2025-03-03 15:16:21,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1240 transitions. [2025-03-03 15:16:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:21,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:21,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:21,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:16:21,402 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:21,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1122338550, now seen corresponding path program 1 times [2025-03-03 15:16:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737102967] [2025-03-03 15:16:21,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:21,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:21,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:21,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:21,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737102967] [2025-03-03 15:16:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737102967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:21,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984112512] [2025-03-03 15:16:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:21,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:21,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:21,548 INFO L87 Difference]: Start difference. First operand 926 states and 1240 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:22,239 INFO L93 Difference]: Finished difference Result 1560 states and 2116 transitions. [2025-03-03 15:16:22,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:22,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:22,240 INFO L225 Difference]: With dead ends: 1560 [2025-03-03 15:16:22,241 INFO L226 Difference]: Without dead ends: 1394 [2025-03-03 15:16:22,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:22,241 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 2855 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:22,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 2596 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-03 15:16:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 918. [2025-03-03 15:16:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3727678571428572) internal successors, (1230), 917 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1230 transitions. [2025-03-03 15:16:22,249 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1230 transitions. Word has length 97 [2025-03-03 15:16:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:22,249 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1230 transitions. [2025-03-03 15:16:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1230 transitions. [2025-03-03 15:16:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:22,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:22,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:16:22,250 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:22,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash -726997041, now seen corresponding path program 1 times [2025-03-03 15:16:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804211221] [2025-03-03 15:16:22,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:22,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:22,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:22,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:22,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804211221] [2025-03-03 15:16:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804211221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:22,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466340034] [2025-03-03 15:16:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:22,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:22,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:22,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:22,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:22,412 INFO L87 Difference]: Start difference. First operand 918 states and 1230 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:23,250 INFO L93 Difference]: Finished difference Result 1716 states and 2338 transitions. [2025-03-03 15:16:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:23,252 INFO L225 Difference]: With dead ends: 1716 [2025-03-03 15:16:23,252 INFO L226 Difference]: Without dead ends: 1438 [2025-03-03 15:16:23,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:23,253 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 2537 mSDsluCounter, 2943 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 3682 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:23,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 3682 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-03-03 15:16:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 910. [2025-03-03 15:16:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.3738738738738738) internal successors, (1220), 909 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1220 transitions. [2025-03-03 15:16:23,260 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1220 transitions. Word has length 97 [2025-03-03 15:16:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1220 transitions. [2025-03-03 15:16:23,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1220 transitions. [2025-03-03 15:16:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:23,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:23,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:23,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:16:23,261 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:23,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 610120943, now seen corresponding path program 1 times [2025-03-03 15:16:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086970539] [2025-03-03 15:16:23,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:23,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:23,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:23,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:23,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:23,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:23,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086970539] [2025-03-03 15:16:23,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086970539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:23,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:23,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40651656] [2025-03-03 15:16:23,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:23,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:23,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:23,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:23,436 INFO L87 Difference]: Start difference. First operand 910 states and 1220 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:24,143 INFO L93 Difference]: Finished difference Result 1488 states and 2001 transitions. [2025-03-03 15:16:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:24,144 INFO L225 Difference]: With dead ends: 1488 [2025-03-03 15:16:24,144 INFO L226 Difference]: Without dead ends: 1338 [2025-03-03 15:16:24,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:24,145 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 3910 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3910 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:24,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3910 Valid, 2358 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-03 15:16:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 910. [2025-03-03 15:16:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.3727477477477477) internal successors, (1219), 909 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1219 transitions. [2025-03-03 15:16:24,152 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1219 transitions. Word has length 98 [2025-03-03 15:16:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:24,152 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1219 transitions. [2025-03-03 15:16:24,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1219 transitions. [2025-03-03 15:16:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:24,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:24,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:24,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:16:24,153 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:24,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash 232814629, now seen corresponding path program 1 times [2025-03-03 15:16:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:24,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394985833] [2025-03-03 15:16:24,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:24,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:24,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:24,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:24,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:24,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394985833] [2025-03-03 15:16:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394985833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474097416] [2025-03-03 15:16:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:24,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:24,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:24,445 INFO L87 Difference]: Start difference. First operand 910 states and 1219 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:25,498 INFO L93 Difference]: Finished difference Result 1863 states and 2543 transitions. [2025-03-03 15:16:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:25,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:25,501 INFO L225 Difference]: With dead ends: 1863 [2025-03-03 15:16:25,501 INFO L226 Difference]: Without dead ends: 1710 [2025-03-03 15:16:25,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:25,502 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 6530 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6530 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:25,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6530 Valid, 2500 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-03 15:16:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 914. [2025-03-03 15:16:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 892 states have (on average 1.3710762331838564) internal successors, (1223), 913 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1223 transitions. [2025-03-03 15:16:25,510 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1223 transitions. Word has length 98 [2025-03-03 15:16:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:25,510 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1223 transitions. [2025-03-03 15:16:25,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1223 transitions. [2025-03-03 15:16:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:25,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:25,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:25,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:16:25,511 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash -963490226, now seen corresponding path program 1 times [2025-03-03 15:16:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:25,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007146581] [2025-03-03 15:16:25,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:25,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:25,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:25,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:25,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007146581] [2025-03-03 15:16:25,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007146581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:25,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:25,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:25,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940499454] [2025-03-03 15:16:25,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:25,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:25,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:25,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:25,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:25,818 INFO L87 Difference]: Start difference. First operand 914 states and 1223 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:26,868 INFO L93 Difference]: Finished difference Result 1860 states and 2539 transitions. [2025-03-03 15:16:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:26,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:26,870 INFO L225 Difference]: With dead ends: 1860 [2025-03-03 15:16:26,870 INFO L226 Difference]: Without dead ends: 1710 [2025-03-03 15:16:26,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:26,870 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 7515 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7515 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:26,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7515 Valid, 2559 Invalid, 2404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-03 15:16:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 918. [2025-03-03 15:16:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3694196428571428) internal successors, (1227), 917 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1227 transitions. [2025-03-03 15:16:26,878 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1227 transitions. Word has length 98 [2025-03-03 15:16:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:26,878 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1227 transitions. [2025-03-03 15:16:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1227 transitions. [2025-03-03 15:16:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:26,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:26,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:26,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:16:26,879 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:26,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1776875779, now seen corresponding path program 1 times [2025-03-03 15:16:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993997532] [2025-03-03 15:16:26,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:26,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:26,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:26,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:26,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:27,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993997532] [2025-03-03 15:16:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993997532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:27,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227374271] [2025-03-03 15:16:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:27,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:27,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:27,034 INFO L87 Difference]: Start difference. First operand 918 states and 1227 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:27,657 INFO L93 Difference]: Finished difference Result 1488 states and 1998 transitions. [2025-03-03 15:16:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:27,658 INFO L225 Difference]: With dead ends: 1488 [2025-03-03 15:16:27,658 INFO L226 Difference]: Without dead ends: 1338 [2025-03-03 15:16:27,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:27,659 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3588 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3588 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:27,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3588 Valid, 2344 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-03 15:16:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 918. [2025-03-03 15:16:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3683035714285714) internal successors, (1226), 917 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1226 transitions. [2025-03-03 15:16:27,665 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1226 transitions. Word has length 98 [2025-03-03 15:16:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:27,665 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1226 transitions. [2025-03-03 15:16:27,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1226 transitions. [2025-03-03 15:16:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:27,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:27,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:27,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:16:27,667 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:27,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2140705763, now seen corresponding path program 1 times [2025-03-03 15:16:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:27,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771977297] [2025-03-03 15:16:27,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:27,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:27,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771977297] [2025-03-03 15:16:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771977297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:27,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:27,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703747579] [2025-03-03 15:16:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:27,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:27,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:27,810 INFO L87 Difference]: Start difference. First operand 918 states and 1226 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:28,415 INFO L93 Difference]: Finished difference Result 1491 states and 2000 transitions. [2025-03-03 15:16:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:28,417 INFO L225 Difference]: With dead ends: 1491 [2025-03-03 15:16:28,417 INFO L226 Difference]: Without dead ends: 1338 [2025-03-03 15:16:28,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:28,417 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2116 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:28,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 2125 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-03 15:16:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 918. [2025-03-03 15:16:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3671875) internal successors, (1225), 917 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1225 transitions. [2025-03-03 15:16:28,426 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1225 transitions. Word has length 98 [2025-03-03 15:16:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1225 transitions. [2025-03-03 15:16:28,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1225 transitions. [2025-03-03 15:16:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:28,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:28,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:28,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:16:28,427 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:28,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1381299338, now seen corresponding path program 1 times [2025-03-03 15:16:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:28,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485677103] [2025-03-03 15:16:28,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:28,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:28,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:28,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:28,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485677103] [2025-03-03 15:16:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485677103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:28,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174039418] [2025-03-03 15:16:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:28,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:28,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:28,696 INFO L87 Difference]: Start difference. First operand 918 states and 1225 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:29,789 INFO L93 Difference]: Finished difference Result 2015 states and 2768 transitions. [2025-03-03 15:16:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:29,791 INFO L225 Difference]: With dead ends: 2015 [2025-03-03 15:16:29,791 INFO L226 Difference]: Without dead ends: 1850 [2025-03-03 15:16:29,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:29,792 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 5201 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5201 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:29,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5201 Valid, 2998 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:16:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-03-03 15:16:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 922. [2025-03-03 15:16:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 900 states have (on average 1.3655555555555556) internal successors, (1229), 921 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1229 transitions. [2025-03-03 15:16:29,801 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1229 transitions. Word has length 98 [2025-03-03 15:16:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:29,801 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1229 transitions. [2025-03-03 15:16:29,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:29,801 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1229 transitions. [2025-03-03 15:16:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:29,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:29,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:29,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:16:29,802 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash 679651704, now seen corresponding path program 1 times [2025-03-03 15:16:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692403184] [2025-03-03 15:16:29,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:29,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:29,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:29,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:29,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:29,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692403184] [2025-03-03 15:16:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692403184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15616606] [2025-03-03 15:16:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:29,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:29,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:29,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:29,980 INFO L87 Difference]: Start difference. First operand 922 states and 1229 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:30,617 INFO L93 Difference]: Finished difference Result 1495 states and 2002 transitions. [2025-03-03 15:16:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:30,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:30,618 INFO L225 Difference]: With dead ends: 1495 [2025-03-03 15:16:30,618 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:30,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:30,619 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 4210 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:30,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 2140 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-03 15:16:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 900 states have (on average 1.3644444444444443) internal successors, (1228), 921 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1228 transitions. [2025-03-03 15:16:30,625 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1228 transitions. Word has length 98 [2025-03-03 15:16:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:30,626 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1228 transitions. [2025-03-03 15:16:30,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1228 transitions. [2025-03-03 15:16:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:30,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:16:30,627 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1593163795, now seen corresponding path program 1 times [2025-03-03 15:16:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363976942] [2025-03-03 15:16:30,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:30,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:30,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363976942] [2025-03-03 15:16:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363976942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364982988] [2025-03-03 15:16:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:30,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:30,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:30,787 INFO L87 Difference]: Start difference. First operand 922 states and 1228 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:31,440 INFO L93 Difference]: Finished difference Result 1492 states and 1998 transitions. [2025-03-03 15:16:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:31,442 INFO L225 Difference]: With dead ends: 1492 [2025-03-03 15:16:31,442 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:31,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:31,443 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3915 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3915 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:31,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3915 Valid, 2342 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-03 15:16:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 900 states have (on average 1.3633333333333333) internal successors, (1227), 921 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1227 transitions. [2025-03-03 15:16:31,449 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1227 transitions. Word has length 98 [2025-03-03 15:16:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:31,449 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1227 transitions. [2025-03-03 15:16:31,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1227 transitions. [2025-03-03 15:16:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:31,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:31,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:31,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:16:31,450 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1128192332, now seen corresponding path program 1 times [2025-03-03 15:16:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:31,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346508290] [2025-03-03 15:16:31,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:31,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:31,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:31,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:31,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346508290] [2025-03-03 15:16:31,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346508290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:31,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:31,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452872320] [2025-03-03 15:16:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:31,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:31,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:31,586 INFO L87 Difference]: Start difference. First operand 922 states and 1227 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:32,191 INFO L93 Difference]: Finished difference Result 1492 states and 1997 transitions. [2025-03-03 15:16:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:32,193 INFO L225 Difference]: With dead ends: 1492 [2025-03-03 15:16:32,193 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:32,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:32,194 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 3146 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3146 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:32,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3146 Valid, 2125 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-03 15:16:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 900 states have (on average 1.3622222222222222) internal successors, (1226), 921 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1226 transitions. [2025-03-03 15:16:32,201 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1226 transitions. Word has length 98 [2025-03-03 15:16:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:32,202 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1226 transitions. [2025-03-03 15:16:32,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1226 transitions. [2025-03-03 15:16:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:32,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:32,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:32,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:16:32,203 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:32,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:32,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1172061482, now seen corresponding path program 1 times [2025-03-03 15:16:32,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4988983] [2025-03-03 15:16:32,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:32,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:32,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:32,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:32,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4988983] [2025-03-03 15:16:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4988983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555363225] [2025-03-03 15:16:32,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:32,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:32,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:32,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:32,354 INFO L87 Difference]: Start difference. First operand 922 states and 1226 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:33,017 INFO L93 Difference]: Finished difference Result 1490 states and 1993 transitions. [2025-03-03 15:16:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:33,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:33,018 INFO L225 Difference]: With dead ends: 1490 [2025-03-03 15:16:33,018 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:33,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:33,019 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 2012 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:33,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 2338 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-03 15:16:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 900 states have (on average 1.3611111111111112) internal successors, (1225), 921 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1225 transitions. [2025-03-03 15:16:33,025 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1225 transitions. Word has length 98 [2025-03-03 15:16:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:33,025 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1225 transitions. [2025-03-03 15:16:33,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1225 transitions. [2025-03-03 15:16:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:33,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:33,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:33,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 15:16:33,027 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:33,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1867618250, now seen corresponding path program 1 times [2025-03-03 15:16:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985447430] [2025-03-03 15:16:33,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:33,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:33,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:33,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:33,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985447430] [2025-03-03 15:16:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985447430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006286192] [2025-03-03 15:16:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:33,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:33,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:33,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:33,284 INFO L87 Difference]: Start difference. First operand 922 states and 1225 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:34,313 INFO L93 Difference]: Finished difference Result 1864 states and 2534 transitions. [2025-03-03 15:16:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:34,315 INFO L225 Difference]: With dead ends: 1864 [2025-03-03 15:16:34,315 INFO L226 Difference]: Without dead ends: 1714 [2025-03-03 15:16:34,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:34,315 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 6140 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6140 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:34,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6140 Valid, 2745 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-03 15:16:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 926. [2025-03-03 15:16:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3595132743362832) internal successors, (1229), 925 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1229 transitions. [2025-03-03 15:16:34,322 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1229 transitions. Word has length 98 [2025-03-03 15:16:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:34,322 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1229 transitions. [2025-03-03 15:16:34,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1229 transitions. [2025-03-03 15:16:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:34,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:34,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:34,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 15:16:34,323 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:34,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -11372695, now seen corresponding path program 1 times [2025-03-03 15:16:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104056867] [2025-03-03 15:16:34,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:34,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:34,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:34,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:34,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104056867] [2025-03-03 15:16:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104056867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:34,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:34,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841171570] [2025-03-03 15:16:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:34,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:34,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:34,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:34,489 INFO L87 Difference]: Start difference. First operand 926 states and 1229 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:35,105 INFO L93 Difference]: Finished difference Result 1490 states and 1991 transitions. [2025-03-03 15:16:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:35,107 INFO L225 Difference]: With dead ends: 1490 [2025-03-03 15:16:35,107 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:35,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:35,108 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 4202 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4202 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:35,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4202 Valid, 2132 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 926. [2025-03-03 15:16:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3584070796460177) internal successors, (1228), 925 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1228 transitions. [2025-03-03 15:16:35,114 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1228 transitions. Word has length 98 [2025-03-03 15:16:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:35,114 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1228 transitions. [2025-03-03 15:16:35,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1228 transitions. [2025-03-03 15:16:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:35,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:35,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:35,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 15:16:35,115 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:35,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1845973552, now seen corresponding path program 1 times [2025-03-03 15:16:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332416949] [2025-03-03 15:16:35,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:35,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:35,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:35,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:35,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:35,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:35,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332416949] [2025-03-03 15:16:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332416949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621190460] [2025-03-03 15:16:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:35,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:35,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:35,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:35,267 INFO L87 Difference]: Start difference. First operand 926 states and 1228 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:35,961 INFO L93 Difference]: Finished difference Result 1423 states and 1886 transitions. [2025-03-03 15:16:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:35,963 INFO L225 Difference]: With dead ends: 1423 [2025-03-03 15:16:35,963 INFO L226 Difference]: Without dead ends: 1406 [2025-03-03 15:16:35,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:35,964 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2738 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2738 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:35,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2738 Valid, 2777 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-03-03 15:16:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 926. [2025-03-03 15:16:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3561946902654867) internal successors, (1226), 925 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1226 transitions. [2025-03-03 15:16:35,970 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1226 transitions. Word has length 98 [2025-03-03 15:16:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:35,970 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1226 transitions. [2025-03-03 15:16:35,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1226 transitions. [2025-03-03 15:16:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:35,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:35,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:35,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 15:16:35,971 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:35,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -388042702, now seen corresponding path program 1 times [2025-03-03 15:16:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722412549] [2025-03-03 15:16:35,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:35,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:35,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:35,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:35,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:36,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722412549] [2025-03-03 15:16:36,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722412549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:36,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:36,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682152021] [2025-03-03 15:16:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:36,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:36,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:36,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:36,128 INFO L87 Difference]: Start difference. First operand 926 states and 1226 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:36,743 INFO L93 Difference]: Finished difference Result 1347 states and 1772 transitions. [2025-03-03 15:16:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:36,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:36,745 INFO L225 Difference]: With dead ends: 1347 [2025-03-03 15:16:36,745 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:36,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:36,746 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 4136 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:36,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 2184 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 926. [2025-03-03 15:16:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3539823008849559) internal successors, (1224), 925 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1224 transitions. [2025-03-03 15:16:36,753 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1224 transitions. Word has length 98 [2025-03-03 15:16:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:36,753 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1224 transitions. [2025-03-03 15:16:36,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1224 transitions. [2025-03-03 15:16:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:36,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:36,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:36,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 15:16:36,755 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:36,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1073011357, now seen corresponding path program 1 times [2025-03-03 15:16:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701948756] [2025-03-03 15:16:36,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:36,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:36,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:36,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:36,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:37,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:37,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701948756] [2025-03-03 15:16:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701948756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:37,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030030816] [2025-03-03 15:16:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:37,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:37,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:37,007 INFO L87 Difference]: Start difference. First operand 926 states and 1224 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:37,951 INFO L93 Difference]: Finished difference Result 1719 states and 2310 transitions. [2025-03-03 15:16:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:37,952 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:37,953 INFO L225 Difference]: With dead ends: 1719 [2025-03-03 15:16:37,953 INFO L226 Difference]: Without dead ends: 1714 [2025-03-03 15:16:37,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:37,954 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 7450 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7450 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:37,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7450 Valid, 2303 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-03 15:16:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 934. [2025-03-03 15:16:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3508771929824561) internal successors, (1232), 933 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1232 transitions. [2025-03-03 15:16:37,962 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1232 transitions. Word has length 98 [2025-03-03 15:16:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:37,962 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1232 transitions. [2025-03-03 15:16:37,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1232 transitions. [2025-03-03 15:16:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:37,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:37,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:37,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 15:16:37,963 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:37,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:37,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1450722815, now seen corresponding path program 1 times [2025-03-03 15:16:37,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:37,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878504196] [2025-03-03 15:16:37,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:37,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:37,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:37,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:37,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:37,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:38,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878504196] [2025-03-03 15:16:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878504196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:38,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475360063] [2025-03-03 15:16:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:38,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:38,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:38,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:38,132 INFO L87 Difference]: Start difference. First operand 934 states and 1232 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:38,744 INFO L93 Difference]: Finished difference Result 1494 states and 1988 transitions. [2025-03-03 15:16:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:38,746 INFO L225 Difference]: With dead ends: 1494 [2025-03-03 15:16:38,746 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:38,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:38,746 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 4145 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4145 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:38,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4145 Valid, 2172 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-03 15:16:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3486842105263157) internal successors, (1230), 933 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1230 transitions. [2025-03-03 15:16:38,753 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1230 transitions. Word has length 98 [2025-03-03 15:16:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:38,753 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1230 transitions. [2025-03-03 15:16:38,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1230 transitions. [2025-03-03 15:16:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:38,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:38,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:38,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 15:16:38,754 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:38,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash -834879777, now seen corresponding path program 1 times [2025-03-03 15:16:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:38,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18171065] [2025-03-03 15:16:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:38,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:38,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:38,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:38,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:38,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18171065] [2025-03-03 15:16:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18171065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:38,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:38,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:38,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12227588] [2025-03-03 15:16:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:38,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:38,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:38,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:38,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:38,902 INFO L87 Difference]: Start difference. First operand 934 states and 1230 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:39,489 INFO L93 Difference]: Finished difference Result 1347 states and 1766 transitions. [2025-03-03 15:16:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:39,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:39,491 INFO L225 Difference]: With dead ends: 1347 [2025-03-03 15:16:39,491 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:39,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:39,491 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 2084 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:39,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 2157 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-03 15:16:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3464912280701755) internal successors, (1228), 933 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1228 transitions. [2025-03-03 15:16:39,499 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1228 transitions. Word has length 98 [2025-03-03 15:16:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:39,499 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1228 transitions. [2025-03-03 15:16:39,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1228 transitions. [2025-03-03 15:16:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:39,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:39,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:39,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 15:16:39,500 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:39,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash -457247759, now seen corresponding path program 1 times [2025-03-03 15:16:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071816560] [2025-03-03 15:16:39,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:39,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:39,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:39,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:39,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:39,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071816560] [2025-03-03 15:16:39,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071816560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:39,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:39,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:39,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325329568] [2025-03-03 15:16:39,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:39,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:39,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:39,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:39,644 INFO L87 Difference]: Start difference. First operand 934 states and 1228 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:40,238 INFO L93 Difference]: Finished difference Result 1494 states and 1982 transitions. [2025-03-03 15:16:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:40,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:40,239 INFO L225 Difference]: With dead ends: 1494 [2025-03-03 15:16:40,239 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:40,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:40,240 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 2083 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:40,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 2172 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-03 15:16:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.344298245614035) internal successors, (1226), 933 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1226 transitions. [2025-03-03 15:16:40,246 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1226 transitions. Word has length 98 [2025-03-03 15:16:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:40,246 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1226 transitions. [2025-03-03 15:16:40,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1226 transitions. [2025-03-03 15:16:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:40,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:40,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 15:16:40,247 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:40,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash 855708336, now seen corresponding path program 1 times [2025-03-03 15:16:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:40,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925501055] [2025-03-03 15:16:40,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:40,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:40,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:40,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:40,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925501055] [2025-03-03 15:16:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925501055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:40,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600786606] [2025-03-03 15:16:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:40,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:40,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:40,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:40,398 INFO L87 Difference]: Start difference. First operand 934 states and 1226 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:41,102 INFO L93 Difference]: Finished difference Result 1578 states and 2098 transitions. [2025-03-03 15:16:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:41,104 INFO L225 Difference]: With dead ends: 1578 [2025-03-03 15:16:41,104 INFO L226 Difference]: Without dead ends: 1414 [2025-03-03 15:16:41,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:41,104 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 3517 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3517 SdHoareTripleChecker+Valid, 3038 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:41,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3517 Valid, 3038 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-03 15:16:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 934. [2025-03-03 15:16:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3421052631578947) internal successors, (1224), 933 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1224 transitions. [2025-03-03 15:16:41,110 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1224 transitions. Word has length 98 [2025-03-03 15:16:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:41,110 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1224 transitions. [2025-03-03 15:16:41,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1224 transitions. [2025-03-03 15:16:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:41,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:41,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:41,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 15:16:41,112 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:41,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash -879386667, now seen corresponding path program 1 times [2025-03-03 15:16:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426636233] [2025-03-03 15:16:41,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:41,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:41,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:41,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:41,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426636233] [2025-03-03 15:16:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426636233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830812693] [2025-03-03 15:16:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:41,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:41,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:41,259 INFO L87 Difference]: Start difference. First operand 934 states and 1224 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:41,871 INFO L93 Difference]: Finished difference Result 1490 states and 1974 transitions. [2025-03-03 15:16:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:41,873 INFO L225 Difference]: With dead ends: 1490 [2025-03-03 15:16:41,873 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:41,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:41,874 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 2865 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2865 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:41,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2865 Valid, 2416 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-03 15:16:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3399122807017543) internal successors, (1222), 933 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1222 transitions. [2025-03-03 15:16:41,880 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1222 transitions. Word has length 98 [2025-03-03 15:16:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:41,880 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1222 transitions. [2025-03-03 15:16:41,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1222 transitions. [2025-03-03 15:16:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:41,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:41,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:41,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 15:16:41,882 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:41,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash -399578380, now seen corresponding path program 1 times [2025-03-03 15:16:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166414492] [2025-03-03 15:16:41,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:41,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:41,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:41,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166414492] [2025-03-03 15:16:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166414492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524611506] [2025-03-03 15:16:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:42,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:42,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:42,045 INFO L87 Difference]: Start difference. First operand 934 states and 1222 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:42,703 INFO L93 Difference]: Finished difference Result 1494 states and 1976 transitions. [2025-03-03 15:16:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:42,705 INFO L225 Difference]: With dead ends: 1494 [2025-03-03 15:16:42,705 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:42,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:42,706 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 3810 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:42,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3810 Valid, 2374 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-03 15:16:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.337719298245614) internal successors, (1220), 933 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1220 transitions. [2025-03-03 15:16:42,713 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1220 transitions. Word has length 98 [2025-03-03 15:16:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:42,713 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1220 transitions. [2025-03-03 15:16:42,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1220 transitions. [2025-03-03 15:16:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:42,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:42,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:42,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 15:16:42,715 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:42,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash -777471557, now seen corresponding path program 1 times [2025-03-03 15:16:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:42,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716914081] [2025-03-03 15:16:42,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:42,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:42,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:42,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:42,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:42,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716914081] [2025-03-03 15:16:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716914081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:42,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:42,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057275729] [2025-03-03 15:16:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:42,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:42,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:42,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:42,969 INFO L87 Difference]: Start difference. First operand 934 states and 1220 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:43,972 INFO L93 Difference]: Finished difference Result 1870 states and 2519 transitions. [2025-03-03 15:16:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:43,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:43,974 INFO L225 Difference]: With dead ends: 1870 [2025-03-03 15:16:43,974 INFO L226 Difference]: Without dead ends: 1714 [2025-03-03 15:16:43,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:43,975 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 6037 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6037 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:43,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6037 Valid, 2793 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-03 15:16:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 942. [2025-03-03 15:16:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 920 states have (on average 1.3347826086956522) internal successors, (1228), 941 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1228 transitions. [2025-03-03 15:16:43,982 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1228 transitions. Word has length 98 [2025-03-03 15:16:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:43,982 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1228 transitions. [2025-03-03 15:16:43,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1228 transitions. [2025-03-03 15:16:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:43,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:43,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-03 15:16:43,983 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:43,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -4509362, now seen corresponding path program 1 times [2025-03-03 15:16:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653962335] [2025-03-03 15:16:43,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:43,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:44,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:44,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:44,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:44,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653962335] [2025-03-03 15:16:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653962335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:44,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:44,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969016707] [2025-03-03 15:16:44,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:44,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:44,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:44,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:44,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:44,132 INFO L87 Difference]: Start difference. First operand 942 states and 1228 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:44,794 INFO L93 Difference]: Finished difference Result 1594 states and 2110 transitions. [2025-03-03 15:16:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:44,795 INFO L225 Difference]: With dead ends: 1594 [2025-03-03 15:16:44,795 INFO L226 Difference]: Without dead ends: 1422 [2025-03-03 15:16:44,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:44,796 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 2657 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2657 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:44,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2657 Valid, 2714 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-03-03 15:16:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 942. [2025-03-03 15:16:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 920 states have (on average 1.3326086956521739) internal successors, (1226), 941 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1226 transitions. [2025-03-03 15:16:44,802 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1226 transitions. Word has length 98 [2025-03-03 15:16:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:44,802 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1226 transitions. [2025-03-03 15:16:44,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1226 transitions. [2025-03-03 15:16:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:44,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:44,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:44,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-03 15:16:44,803 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:44,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2056441680, now seen corresponding path program 1 times [2025-03-03 15:16:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397100528] [2025-03-03 15:16:44,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:44,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:44,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:44,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:44,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:44,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:44,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397100528] [2025-03-03 15:16:44,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397100528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:44,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:44,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:44,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614273255] [2025-03-03 15:16:44,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:44,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:44,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:44,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:44,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:44,954 INFO L87 Difference]: Start difference. First operand 942 states and 1226 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:45,567 INFO L93 Difference]: Finished difference Result 1498 states and 1975 transitions. [2025-03-03 15:16:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:45,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:45,569 INFO L225 Difference]: With dead ends: 1498 [2025-03-03 15:16:45,569 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:45,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:45,570 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 4040 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4040 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:45,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4040 Valid, 2228 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 942. [2025-03-03 15:16:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 920 states have (on average 1.3304347826086957) internal successors, (1224), 941 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1224 transitions. [2025-03-03 15:16:45,576 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1224 transitions. Word has length 98 [2025-03-03 15:16:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1224 transitions. [2025-03-03 15:16:45,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1224 transitions. [2025-03-03 15:16:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:45,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:45,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:45,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-03 15:16:45,577 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:45,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:45,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1858235353, now seen corresponding path program 1 times [2025-03-03 15:16:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481512739] [2025-03-03 15:16:45,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:45,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:45,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:45,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:45,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481512739] [2025-03-03 15:16:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481512739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040147375] [2025-03-03 15:16:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:45,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:45,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:45,707 INFO L87 Difference]: Start difference. First operand 942 states and 1224 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:46,398 INFO L93 Difference]: Finished difference Result 1666 states and 2204 transitions. [2025-03-03 15:16:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:46,399 INFO L225 Difference]: With dead ends: 1666 [2025-03-03 15:16:46,399 INFO L226 Difference]: Without dead ends: 1454 [2025-03-03 15:16:46,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:46,400 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 2510 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2510 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:46,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2510 Valid, 3013 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-03 15:16:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 942. [2025-03-03 15:16:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 920 states have (on average 1.3282608695652174) internal successors, (1222), 941 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1222 transitions. [2025-03-03 15:16:46,406 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1222 transitions. Word has length 98 [2025-03-03 15:16:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:46,406 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1222 transitions. [2025-03-03 15:16:46,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1222 transitions. [2025-03-03 15:16:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:46,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:46,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:46,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-03 15:16:46,407 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:46,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1228052951, now seen corresponding path program 1 times [2025-03-03 15:16:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:46,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875268167] [2025-03-03 15:16:46,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:46,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:46,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:46,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:46,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:46,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875268167] [2025-03-03 15:16:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875268167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:46,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:46,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588465679] [2025-03-03 15:16:46,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:46,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:46,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:46,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:46,566 INFO L87 Difference]: Start difference. First operand 942 states and 1222 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:47,276 INFO L93 Difference]: Finished difference Result 1594 states and 2100 transitions. [2025-03-03 15:16:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:47,277 INFO L225 Difference]: With dead ends: 1594 [2025-03-03 15:16:47,277 INFO L226 Difference]: Without dead ends: 1422 [2025-03-03 15:16:47,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:47,278 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 3442 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:47,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 3162 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-03-03 15:16:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 942. [2025-03-03 15:16:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 920 states have (on average 1.326086956521739) internal successors, (1220), 941 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1220 transitions. [2025-03-03 15:16:47,284 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1220 transitions. Word has length 98 [2025-03-03 15:16:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:47,284 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1220 transitions. [2025-03-03 15:16:47,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1220 transitions. [2025-03-03 15:16:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:47,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:47,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:47,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-03 15:16:47,285 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:47,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash 832898091, now seen corresponding path program 1 times [2025-03-03 15:16:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:47,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833300928] [2025-03-03 15:16:47,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:47,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833300928] [2025-03-03 15:16:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833300928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:47,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964699475] [2025-03-03 15:16:47,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:47,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:47,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:47,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:47,435 INFO L87 Difference]: Start difference. First operand 942 states and 1220 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:48,018 INFO L93 Difference]: Finished difference Result 1498 states and 1969 transitions. [2025-03-03 15:16:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:48,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:48,020 INFO L225 Difference]: With dead ends: 1498 [2025-03-03 15:16:48,020 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:48,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:48,020 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 3541 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3541 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:48,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3541 Valid, 2286 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 942. [2025-03-03 15:16:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 920 states have (on average 1.3239130434782609) internal successors, (1218), 941 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1218 transitions. [2025-03-03 15:16:48,027 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1218 transitions. Word has length 98 [2025-03-03 15:16:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:48,027 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1218 transitions. [2025-03-03 15:16:48,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1218 transitions. [2025-03-03 15:16:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:48,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:48,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:48,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-03 15:16:48,028 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:48,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash 247407176, now seen corresponding path program 1 times [2025-03-03 15:16:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:48,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266637154] [2025-03-03 15:16:48,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:48,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:48,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:48,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:48,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266637154] [2025-03-03 15:16:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266637154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:48,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441426533] [2025-03-03 15:16:48,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:48,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:48,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:48,173 INFO L87 Difference]: Start difference. First operand 942 states and 1218 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:48,773 INFO L93 Difference]: Finished difference Result 1495 states and 1963 transitions. [2025-03-03 15:16:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:48,774 INFO L225 Difference]: With dead ends: 1495 [2025-03-03 15:16:48,775 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:48,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:48,775 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 2967 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2967 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:48,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2967 Valid, 2281 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 938. [2025-03-03 15:16:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 916 states have (on average 1.324235807860262) internal successors, (1213), 937 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1213 transitions. [2025-03-03 15:16:48,781 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1213 transitions. Word has length 99 [2025-03-03 15:16:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:48,781 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1213 transitions. [2025-03-03 15:16:48,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1213 transitions. [2025-03-03 15:16:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:48,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:48,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:48,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-03 15:16:48,782 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:48,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1918001654, now seen corresponding path program 1 times [2025-03-03 15:16:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:48,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229786706] [2025-03-03 15:16:48,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:48,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:48,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:48,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:48,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:48,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229786706] [2025-03-03 15:16:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229786706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:48,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145228951] [2025-03-03 15:16:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:48,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:48,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:48,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:48,913 INFO L87 Difference]: Start difference. First operand 938 states and 1213 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:49,538 INFO L93 Difference]: Finished difference Result 1492 states and 1959 transitions. [2025-03-03 15:16:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:49,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:49,539 INFO L225 Difference]: With dead ends: 1492 [2025-03-03 15:16:49,539 INFO L226 Difference]: Without dead ends: 1342 [2025-03-03 15:16:49,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:49,539 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2961 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2961 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:49,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2961 Valid, 2276 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-03 15:16:49,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-03 15:16:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 912 states have (on average 1.3245614035087718) internal successors, (1208), 933 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1208 transitions. [2025-03-03 15:16:49,546 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1208 transitions. Word has length 99 [2025-03-03 15:16:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:49,546 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1208 transitions. [2025-03-03 15:16:49,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1208 transitions. [2025-03-03 15:16:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:49,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:49,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:49,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-03 15:16:49,547 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:49,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1184737288, now seen corresponding path program 1 times [2025-03-03 15:16:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:49,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377783832] [2025-03-03 15:16:49,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:49,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:49,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:49,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:49,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:49,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377783832] [2025-03-03 15:16:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377783832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:49,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:49,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163456804] [2025-03-03 15:16:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:49,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:49,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:49,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:49,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:49,684 INFO L87 Difference]: Start difference. First operand 934 states and 1208 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:50,379 INFO L93 Difference]: Finished difference Result 1575 states and 2070 transitions. [2025-03-03 15:16:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:50,380 INFO L225 Difference]: With dead ends: 1575 [2025-03-03 15:16:50,380 INFO L226 Difference]: Without dead ends: 1410 [2025-03-03 15:16:50,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:50,381 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 2495 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2495 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:50,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2495 Valid, 2906 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-03-03 15:16:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 930. [2025-03-03 15:16:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 908 states have (on average 1.3248898678414096) internal successors, (1203), 929 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1203 transitions. [2025-03-03 15:16:50,387 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1203 transitions. Word has length 99 [2025-03-03 15:16:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:50,387 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1203 transitions. [2025-03-03 15:16:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1203 transitions. [2025-03-03 15:16:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:50,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:50,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:50,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-03 15:16:50,388 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:50,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -505692696, now seen corresponding path program 1 times [2025-03-03 15:16:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:50,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372436666] [2025-03-03 15:16:50,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:50,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:50,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:50,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:50,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372436666] [2025-03-03 15:16:50,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372436666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:50,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:50,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89498720] [2025-03-03 15:16:50,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:50,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:50,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:50,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:50,531 INFO L87 Difference]: Start difference. First operand 930 states and 1203 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:51,157 INFO L93 Difference]: Finished difference Result 1488 states and 1953 transitions. [2025-03-03 15:16:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:51,160 INFO L225 Difference]: With dead ends: 1488 [2025-03-03 15:16:51,160 INFO L226 Difference]: Without dead ends: 1338 [2025-03-03 15:16:51,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:51,161 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 2911 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2911 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:51,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2911 Valid, 2341 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-03 15:16:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 926. [2025-03-03 15:16:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.325221238938053) internal successors, (1198), 925 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1198 transitions. [2025-03-03 15:16:51,167 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1198 transitions. Word has length 99 [2025-03-03 15:16:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1198 transitions. [2025-03-03 15:16:51,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1198 transitions. [2025-03-03 15:16:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:51,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:51,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:51,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-03 15:16:51,168 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:51,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 991650033, now seen corresponding path program 1 times [2025-03-03 15:16:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:51,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327704034] [2025-03-03 15:16:51,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:51,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:51,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:51,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:51,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327704034] [2025-03-03 15:16:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327704034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926201071] [2025-03-03 15:16:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:51,331 INFO L87 Difference]: Start difference. First operand 926 states and 1198 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:51,920 INFO L93 Difference]: Finished difference Result 1487 states and 1951 transitions. [2025-03-03 15:16:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:51,921 INFO L225 Difference]: With dead ends: 1487 [2025-03-03 15:16:51,921 INFO L226 Difference]: Without dead ends: 1338 [2025-03-03 15:16:51,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:51,922 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 3494 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3494 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:51,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3494 Valid, 2358 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-03 15:16:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 926. [2025-03-03 15:16:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 904 states have (on average 1.3241150442477876) internal successors, (1197), 925 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1197 transitions. [2025-03-03 15:16:51,928 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1197 transitions. Word has length 99 [2025-03-03 15:16:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:51,928 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1197 transitions. [2025-03-03 15:16:51,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1197 transitions. [2025-03-03 15:16:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:51,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:51,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:51,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-03 15:16:51,929 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:51,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash 523701560, now seen corresponding path program 1 times [2025-03-03 15:16:51,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:51,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239085114] [2025-03-03 15:16:51,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:51,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:51,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:51,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:51,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:52,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:52,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239085114] [2025-03-03 15:16:52,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239085114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:52,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:52,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:52,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085761540] [2025-03-03 15:16:52,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:52,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:52,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:52,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:52,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:52,062 INFO L87 Difference]: Start difference. First operand 926 states and 1197 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:52,691 INFO L93 Difference]: Finished difference Result 1343 states and 1733 transitions. [2025-03-03 15:16:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:52,693 INFO L225 Difference]: With dead ends: 1343 [2025-03-03 15:16:52,693 INFO L226 Difference]: Without dead ends: 1338 [2025-03-03 15:16:52,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:52,694 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 2896 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2896 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:52,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2896 Valid, 2353 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-03 15:16:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 918. [2025-03-03 15:16:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 896 states have (on average 1.3247767857142858) internal successors, (1187), 917 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1187 transitions. [2025-03-03 15:16:52,701 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1187 transitions. Word has length 99 [2025-03-03 15:16:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:52,701 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1187 transitions. [2025-03-03 15:16:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1187 transitions. [2025-03-03 15:16:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:52,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:52,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:52,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-03 15:16:52,702 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:52,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1006694109, now seen corresponding path program 1 times [2025-03-03 15:16:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:52,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927949699] [2025-03-03 15:16:52,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:52,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:52,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:52,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927949699] [2025-03-03 15:16:52,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927949699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:52,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:52,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639481534] [2025-03-03 15:16:52,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:52,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:52,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:52,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:52,869 INFO L87 Difference]: Start difference. First operand 918 states and 1187 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:53,491 INFO L93 Difference]: Finished difference Result 1494 states and 1956 transitions. [2025-03-03 15:16:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:53,493 INFO L225 Difference]: With dead ends: 1494 [2025-03-03 15:16:53,493 INFO L226 Difference]: Without dead ends: 1338 [2025-03-03 15:16:53,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:16:53,493 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 3826 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3826 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:53,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3826 Valid, 2369 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-03 15:16:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 910. [2025-03-03 15:16:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 888 states have (on average 1.3254504504504505) internal successors, (1177), 909 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1177 transitions. [2025-03-03 15:16:53,499 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1177 transitions. Word has length 99 [2025-03-03 15:16:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:53,499 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1177 transitions. [2025-03-03 15:16:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1177 transitions. [2025-03-03 15:16:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:53,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:53,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-03 15:16:53,500 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1761222833, now seen corresponding path program 1 times [2025-03-03 15:16:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:53,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049711293] [2025-03-03 15:16:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:53,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:53,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:53,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:53,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:53,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:53,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049711293] [2025-03-03 15:16:53,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049711293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:53,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:53,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751267933] [2025-03-03 15:16:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:53,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:16:53,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:53,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:16:53,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:16:53,845 INFO L87 Difference]: Start difference. First operand 910 states and 1177 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:54,243 INFO L93 Difference]: Finished difference Result 1328 states and 1735 transitions. [2025-03-03 15:16:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:54,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:54,244 INFO L225 Difference]: With dead ends: 1328 [2025-03-03 15:16:54,244 INFO L226 Difference]: Without dead ends: 959 [2025-03-03 15:16:54,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:16:54,245 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1856 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:54,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 2500 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:16:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-03 15:16:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 689. [2025-03-03 15:16:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 673 states have (on average 1.325408618127786) internal successors, (892), 688 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 892 transitions. [2025-03-03 15:16:54,249 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 892 transitions. Word has length 100 [2025-03-03 15:16:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:54,249 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 892 transitions. [2025-03-03 15:16:54,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 892 transitions. [2025-03-03 15:16:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:54,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:54,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:54,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-03 15:16:54,250 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1437056528, now seen corresponding path program 1 times [2025-03-03 15:16:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062737125] [2025-03-03 15:16:54,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:54,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:54,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:54,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:54,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:54,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062737125] [2025-03-03 15:16:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062737125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:54,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:54,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:16:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527430443] [2025-03-03 15:16:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:16:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:54,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:16:54,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:54,663 INFO L87 Difference]: Start difference. First operand 689 states and 892 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:55,101 INFO L93 Difference]: Finished difference Result 1241 states and 1660 transitions. [2025-03-03 15:16:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:55,101 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:55,102 INFO L225 Difference]: With dead ends: 1241 [2025-03-03 15:16:55,102 INFO L226 Difference]: Without dead ends: 893 [2025-03-03 15:16:55,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:16:55,103 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 891 mSDsluCounter, 4650 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 5277 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:55,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 5277 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:16:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-03 15:16:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 489. [2025-03-03 15:16:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 478 states have (on average 1.3305439330543933) internal successors, (636), 488 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 636 transitions. [2025-03-03 15:16:55,107 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 636 transitions. Word has length 100 [2025-03-03 15:16:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 636 transitions. [2025-03-03 15:16:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 636 transitions. [2025-03-03 15:16:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:55,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:55,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:55,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-03 15:16:55,108 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:55,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1983070732, now seen corresponding path program 1 times [2025-03-03 15:16:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:55,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341050621] [2025-03-03 15:16:55,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:55,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:55,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:55,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:55,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341050621] [2025-03-03 15:16:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341050621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:55,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:16:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765125835] [2025-03-03 15:16:55,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:55,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:16:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:16:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:55,486 INFO L87 Difference]: Start difference. First operand 489 states and 636 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:56,023 INFO L93 Difference]: Finished difference Result 1403 states and 1923 transitions. [2025-03-03 15:16:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:16:56,024 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:56,025 INFO L225 Difference]: With dead ends: 1403 [2025-03-03 15:16:56,025 INFO L226 Difference]: Without dead ends: 1209 [2025-03-03 15:16:56,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:16:56,025 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 1562 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:56,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 4395 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:16:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-03 15:16:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 443. [2025-03-03 15:16:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.327944572748268) internal successors, (575), 442 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 575 transitions. [2025-03-03 15:16:56,029 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 575 transitions. Word has length 100 [2025-03-03 15:16:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:56,029 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 575 transitions. [2025-03-03 15:16:56,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 575 transitions. [2025-03-03 15:16:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:56,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:56,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:56,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-03 15:16:56,030 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1239430862, now seen corresponding path program 1 times [2025-03-03 15:16:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:56,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962459186] [2025-03-03 15:16:56,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:56,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:56,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:56,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:56,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962459186] [2025-03-03 15:16:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962459186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:16:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987990365] [2025-03-03 15:16:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:56,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:56,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:56,342 INFO L87 Difference]: Start difference. First operand 443 states and 575 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:56,668 INFO L93 Difference]: Finished difference Result 883 states and 1199 transitions. [2025-03-03 15:16:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:16:56,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:56,669 INFO L225 Difference]: With dead ends: 883 [2025-03-03 15:16:56,669 INFO L226 Difference]: Without dead ends: 669 [2025-03-03 15:16:56,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:16:56,669 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1107 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:56,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2392 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-03 15:16:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 377. [2025-03-03 15:16:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 370 states have (on average 1.3243243243243243) internal successors, (490), 376 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 490 transitions. [2025-03-03 15:16:56,672 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 490 transitions. Word has length 100 [2025-03-03 15:16:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:56,672 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 490 transitions. [2025-03-03 15:16:56,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 490 transitions. [2025-03-03 15:16:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:56,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:56,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:56,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-03 15:16:56,673 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2059889655, now seen corresponding path program 1 times [2025-03-03 15:16:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950499301] [2025-03-03 15:16:56,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:56,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:56,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:56,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:56,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950499301] [2025-03-03 15:16:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950499301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:57,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:16:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747587369] [2025-03-03 15:16:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:16:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:57,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:16:57,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:57,019 INFO L87 Difference]: Start difference. First operand 377 states and 490 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:57,640 INFO L93 Difference]: Finished difference Result 1179 states and 1635 transitions. [2025-03-03 15:16:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:16:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:57,642 INFO L225 Difference]: With dead ends: 1179 [2025-03-03 15:16:57,642 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 15:16:57,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:16:57,642 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1155 mSDsluCounter, 4881 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 5556 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:57,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 5556 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 15:16:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 323. [2025-03-03 15:16:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 319 states have (on average 1.3134796238244515) internal successors, (419), 322 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2025-03-03 15:16:57,645 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 100 [2025-03-03 15:16:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:57,646 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2025-03-03 15:16:57,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2025-03-03 15:16:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:57,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:57,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:57,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-03-03 15:16:57,646 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:57,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 857447175, now seen corresponding path program 1 times [2025-03-03 15:16:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033656078] [2025-03-03 15:16:57,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:57,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:57,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:57,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:57,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:57,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:58,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:58,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033656078] [2025-03-03 15:16:58,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033656078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:58,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:58,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 15:16:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587932060] [2025-03-03 15:16:58,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:58,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:16:58,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:58,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:16:58,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:16:58,387 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:59,224 INFO L93 Difference]: Finished difference Result 670 states and 917 transitions. [2025-03-03 15:16:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 15:16:59,224 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:59,224 INFO L225 Difference]: With dead ends: 670 [2025-03-03 15:16:59,224 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 15:16:59,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 15:16:59,225 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 521 mSDsluCounter, 2744 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:59,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2943 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:16:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 15:16:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 345. [2025-03-03 15:16:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 341 states have (on average 1.313782991202346) internal successors, (448), 344 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 448 transitions. [2025-03-03 15:16:59,228 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 448 transitions. Word has length 100 [2025-03-03 15:16:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:59,228 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 448 transitions. [2025-03-03 15:16:59,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 448 transitions. [2025-03-03 15:16:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:16:59,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:59,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:59,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-03-03 15:16:59,228 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:59,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:59,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1691340592, now seen corresponding path program 1 times [2025-03-03 15:16:59,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:59,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067709016] [2025-03-03 15:16:59,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:59,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:16:59,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:16:59,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:59,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:59,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:59,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067709016] [2025-03-03 15:16:59,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067709016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:59,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:59,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:16:59,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483361696] [2025-03-03 15:16:59,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:59,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:59,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:59,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:59,553 INFO L87 Difference]: Start difference. First operand 345 states and 448 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:59,816 INFO L93 Difference]: Finished difference Result 673 states and 925 transitions. [2025-03-03 15:16:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:59,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:16:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:59,817 INFO L225 Difference]: With dead ends: 673 [2025-03-03 15:16:59,817 INFO L226 Difference]: Without dead ends: 519 [2025-03-03 15:16:59,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:16:59,818 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1349 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:59,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1278 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-03 15:16:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 313. [2025-03-03 15:16:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 310 states have (on average 1.303225806451613) internal successors, (404), 312 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 404 transitions. [2025-03-03 15:16:59,820 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 404 transitions. Word has length 101 [2025-03-03 15:16:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:59,820 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 404 transitions. [2025-03-03 15:16:59,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 404 transitions. [2025-03-03 15:16:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:16:59,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:59,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:16:59,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-03-03 15:16:59,821 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:59,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash -932116863, now seen corresponding path program 1 times [2025-03-03 15:16:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262447579] [2025-03-03 15:16:59,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:59,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:16:59,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:16:59,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:59,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat