./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 06:26:44,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:26:44,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:26:44,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:26:44,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:26:44,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:26:44,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:26:44,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:26:44,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:26:44,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:26:44,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:26:44,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:26:44,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:26:44,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:26:44,609 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:26:44,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:26:44,610 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:26:44,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:26:44,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:26:44,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:26:44,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:26:44,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:26:44,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:26:44,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:26:44,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:26:44,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:26:44,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:26:44,612 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-08 06:26:44,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:26:44,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:26:44,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:26:44,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:26:44,842 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:26:44,847 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-08 06:26:46,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda3842e3/8d588e7fa05946eaa84af85f5e7fd7a3/FLAGec7d7a882 [2025-03-08 06:26:46,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:26:46,455 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-08 06:26:46,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda3842e3/8d588e7fa05946eaa84af85f5e7fd7a3/FLAGec7d7a882 [2025-03-08 06:26:46,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda3842e3/8d588e7fa05946eaa84af85f5e7fd7a3 [2025-03-08 06:26:46,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:26:46,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:26:46,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:26:46,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:26:46,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:26:46,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:26:46" (1/1) ... [2025-03-08 06:26:46,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b1c57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:46, skipping insertion in model container [2025-03-08 06:26:46,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:26:46" (1/1) ... [2025-03-08 06:26:46,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:26:46,926 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-08 06:26:46,952 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-08 06:26:46,958 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-08 06:26:46,966 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-08 06:26:46,972 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-08 06:26:46,975 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-08 06:26:46,979 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-08 06:26:46,988 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-08 06:26:46,991 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-08 06:26:46,995 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-08 06:26:47,001 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-08 06:26:47,018 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-08 06:26:47,021 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-08 06:26:47,024 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-08 06:26:47,031 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-08 06:26:47,045 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-08 06:26:47,075 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-08 06:26:47,080 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-08 06:26:47,087 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-08 06:26:47,097 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-08 06:26:47,108 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-08 06:26:47,120 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-08 06:26:47,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:26:47,349 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:26:47,437 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-08 06:26:47,444 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-08 06:26:47,447 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-08 06:26:47,449 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-08 06:26:47,453 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-08 06:26:47,455 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-08 06:26:47,457 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-08 06:26:47,462 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-08 06:26:47,464 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-08 06:26:47,466 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-08 06:26:47,470 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-08 06:26:47,477 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-08 06:26:47,479 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-08 06:26:47,482 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-08 06:26:47,487 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-08 06:26:47,494 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-08 06:26:47,507 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-08 06:26:47,509 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-08 06:26:47,512 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-08 06:26:47,516 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-08 06:26:47,525 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-08 06:26:47,535 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-08 06:26:47,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:26:47,687 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:26:47,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47 WrapperNode [2025-03-08 06:26:47,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:26:47,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:26:47,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:26:47,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:26:47,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,856 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7085 [2025-03-08 06:26:47,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:26:47,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:26:47,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:26:47,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:26:47,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,935 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-08 06:26:47,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:47,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:48,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:48,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:48,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:26:48,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:26:48,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:26:48,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:26:48,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (1/1) ... [2025-03-08 06:26:48,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:26:48,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:26:48,069 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-08 06:26:48,075 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-08 06:26:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:26:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:26:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:26:48,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:26:48,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:26:48,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:26:50,947 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10276: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-08 06:26:50,948 INFO L1307 $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-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4465: havoc main_~check__tmp~41#1;havoc main_~node6__m6~27#1; [2025-03-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8826: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-08 06:26:50,949 INFO L1307 $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-08 06:26:50,949 INFO L1307 $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-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc main_~check__tmp~22#1; [2025-03-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4864: havoc main_~node6__m6~31#1; [2025-03-08 06:26:50,949 INFO L1307 $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-08 06:26:50,949 INFO L1307 $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-08 06:26:50,949 INFO L1307 $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-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8433: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node3__m3~1#1; [2025-03-08 06:26:50,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: havoc main_~check__tmp~25#1; [2025-03-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3546: havoc main_~check__tmp~31#1; [2025-03-08 06:26:50,950 INFO L1307 $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-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2225: havoc main_~node4__m4~4#1; [2025-03-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7114: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L905: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:26:50,950 INFO L1307 $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-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3284: havoc main_~node3__m3~4#1; [2025-03-08 06:26:50,950 INFO L1307 $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-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: havoc main_~node6__m6~8#1; [2025-03-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8043: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L644: havoc main_~node3__m3~2#1; [2025-03-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1569: havoc main_~check__tmp~9#1; [2025-03-08 06:26:50,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6590: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-08 06:26:50,950 INFO L1307 $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-08 06:26:50,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6194: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-08 06:26:50,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:26:50,951 INFO L1307 $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-08 06:26:50,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10293: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-08 06:26:50,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3951: havoc main_~check__tmp~36#1; [2025-03-08 06:26:50,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1177: havoc main_~node6__m6~3#1; [2025-03-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5274: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4085: havoc main_~node5__m5~13#1; [2025-03-08 06:26:50,952 INFO L1307 $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-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4746: havoc main_~node4__m4~9#1; [2025-03-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5804: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-08 06:26:50,952 INFO L1307 $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-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031: havoc main_~node5__m5~9#1; [2025-03-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node4__m4~1#1; [2025-03-08 06:26:50,952 INFO L1307 $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-08 06:26:50,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2107: havoc main_~check__tmp~16#1;havoc main_~node6__m6~9#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8450: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2240: havoc main_~node5__m5~6#1; [2025-03-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3694: havoc main_~check__tmp~33#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3299: havoc main_~node4__m4~6#1; [2025-03-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7661: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L659: havoc main_~node4__m4~2#1; [2025-03-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10834: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8060: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5023: havoc main_~node6__m6~33#1; [2025-03-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10310: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4761: havoc main_~node5__m5~16#1; [2025-03-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: havoc main_~node4__m4~5#1; [2025-03-08 06:26:50,953 INFO L1307 $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-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9917: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5821: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L536: havoc main_~node5__m5~1#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc main_~node6__m6~10#1; [2025-03-08 06:26:50,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8994: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-08 06:26:50,955 INFO L1307 $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-08 06:26:50,955 INFO L1307 $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-08 06:26:50,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3314: havoc main_~node5__m5~10#1; [2025-03-08 06:26:50,955 INFO L1307 $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-08 06:26:50,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc main_~node5__m5~2#1; [2025-03-08 06:26:50,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9527: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-08 06:26:50,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3846: havoc main_~node4__m4~7#1; [2025-03-08 06:26:50,955 INFO L1307 $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-08 06:26:50,955 INFO L1307 $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-08 06:26:50,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7678: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-08 06:26:50,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1337: havoc main_~node5__m5~3#1; [2025-03-08 06:26:50,956 INFO L1307 $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-08 06:26:50,956 INFO L1307 $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-08 06:26:50,956 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8077: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-08 06:26:50,956 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: havoc main_~node5__m5~7#1; [2025-03-08 06:26:50,956 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2396: havoc main_~node6__m6~11#1; [2025-03-08 06:26:50,956 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-08 06:26:50,956 INFO L1307 $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-08 06:26:50,956 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6362: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-08 06:26:50,956 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7288: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-08 06:26:50,956 INFO L1307 $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-08 06:26:50,957 INFO L1307 $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-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2796: havoc main_~node5__m5~8#1; [2025-03-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L815: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4647: havoc main_~node6__m6~29#1; [2025-03-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc main_~node6__m6~1#1; [2025-03-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-08 06:26:50,957 INFO L1307 $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-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5838: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9934: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L950: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:26:50,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3329: havoc main_~node6__m6~18#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5445: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: havoc main_~node6__m6~2#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3861: havoc main_~node5__m5~12#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8618: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1352: havoc main_~node6__m6~4#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9544: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4127: havoc main_~check__tmp~38#1;havoc main_~node6__m6~24#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: havoc main_~node6__m6~12#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8094: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3073: havoc main_~check__tmp~27#1;havoc main_~node6__m6~16#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: havoc main_~node6__m6~19#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811: havoc main_~node6__m6~14#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3604: havoc main_~node5__m5~11#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4398: havoc main_~check__tmp~40#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7305: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10478: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1494: havoc main_~node6__m6~5#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2684: havoc main_~check__tmp~23#1;havoc main_~node6__m6~13#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892: havoc main_~check__tmp~13#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3876: havoc main_~node6__m6~22#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5462: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: havoc main_~check__tmp~26#1;havoc main_~node6__m6~15#1; [2025-03-08 06:26:50,958 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4803: havoc main_~check__tmp~43#1;havoc main_~node6__m6~30#1; [2025-03-08 06:26:50,958 INFO L1307 $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-08 06:26:50,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9561: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-08 06:26:50,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9165: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-08 06:26:50,959 INFO L1307 $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-08 06:26:50,959 INFO L1307 $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-08 06:26:50,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7846: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-08 06:26:50,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4279: havoc main_~node3__m3~5#1; [2025-03-08 06:26:50,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3619: havoc main_~node6__m6~20#1; [2025-03-08 06:26:50,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4544: havoc main_~node5__m5~15#1; [2025-03-08 06:26:50,959 INFO L1307 $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-08 06:26:50,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4018: havoc main_~check__tmp~37#1;havoc main_~node6__m6~23#1; [2025-03-08 06:26:50,960 INFO L1307 $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-08 06:26:50,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7322: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-08 06:26:50,961 INFO L1307 $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-08 06:26:50,961 INFO L1307 $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-08 06:26:50,961 INFO L1307 $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-08 06:26:50,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4945: havoc main_~node5__m5~17#1; [2025-03-08 06:26:50,961 INFO L1307 $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-08 06:26:50,961 INFO L1307 $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-08 06:26:50,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2040: havoc main_~check__tmp~15#1; [2025-03-08 06:26:50,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6929: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-08 06:26:50,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1645: havoc main_~node4__m4~3#1; [2025-03-08 06:26:50,961 INFO L1307 $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-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10102: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3761: havoc main_~check__tmp~34#1;havoc main_~node6__m6~21#1; [2025-03-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9578: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6539: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9182: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4294: havoc main_~node4__m4~8#1; [2025-03-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L860: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8262: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L995: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4960: havoc main_~node6__m6~32#1; [2025-03-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8792: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1660: havoc main_~node5__m5~4#1; [2025-03-08 06:26:50,962 INFO L1307 $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-08 06:26:50,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6946: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10649: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4176: havoc main_~node6__m6~25#1; [2025-03-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5630: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4309: havoc main_~node5__m5~14#1; [2025-03-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6556: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $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-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8809: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-08 06:26:50,963 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1675: havoc main_~node6__m6~6#1; [2025-03-08 06:26:50,963 INFO L1307 $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-08 06:26:50,965 INFO L1307 $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-08 06:26:50,965 INFO L1307 $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-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7490: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-08 06:26:50,965 INFO L1307 $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-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2470: havoc main_~check__tmp~20#1; [2025-03-08 06:26:50,965 INFO L1307 $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-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4586: havoc main_~check__tmp~42#1;havoc main_~node6__m6~28#1; [2025-03-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L491: havoc main_~node2__m2~1#1; [2025-03-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134: havoc main_~node6__m6~17#1; [2025-03-08 06:26:50,965 INFO L1307 $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-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10666: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2210: havoc main_~node3__m3~3#1; [2025-03-08 06:26:50,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4324: havoc main_~node6__m6~26#1; [2025-03-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: havoc main_~node2__m2~3#1; [2025-03-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8026: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-08 06:26:50,966 INFO L1307 $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-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6573: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6177: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: havoc main_~node6__m6~7#1; [2025-03-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1950: havoc main_~node5__m5~5#1; [2025-03-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9746: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: havoc main_~node2__m2~2#1; [2025-03-08 06:26:50,966 INFO L1307 $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-08 06:26:50,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9350: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-08 06:26:51,199 INFO L? ?]: Removed 1124 outVars from TransFormulas that were not future-live. [2025-03-08 06:26:51,199 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:26:51,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:26:51,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:26:51,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:26:51 BoogieIcfgContainer [2025-03-08 06:26:51,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:26:51,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:26:51,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:26:51,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:26:51,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:26:46" (1/3) ... [2025-03-08 06:26:51,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d607276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:26:51, skipping insertion in model container [2025-03-08 06:26:51,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:47" (2/3) ... [2025-03-08 06:26:51,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d607276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:26:51, skipping insertion in model container [2025-03-08 06:26:51,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:26:51" (3/3) ... [2025-03-08 06:26:51,249 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2025-03-08 06:26:51,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:26:51,266 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-08 06:26:51,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:26:51,352 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;@5d6345e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:26:51,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 06:26:51,359 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-08 06:26:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:26:51,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:51,374 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-08 06:26:51,374 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-08 06:26:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -39771553, now seen corresponding path program 1 times [2025-03-08 06:26:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870662976] [2025-03-08 06:26:51,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:51,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:26:51,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:26:51,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:51,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:51,957 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-08 06:26:51,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:51,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870662976] [2025-03-08 06:26:51,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870662976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:51,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:51,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:51,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935137175] [2025-03-08 06:26:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:51,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:51,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:51,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:51,986 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-08 06:26:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:52,705 INFO L93 Difference]: Finished difference Result 1715 states and 3012 transitions. [2025-03-08 06:26:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:52,707 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-08 06:26:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:52,719 INFO L225 Difference]: With dead ends: 1715 [2025-03-08 06:26:52,719 INFO L226 Difference]: Without dead ends: 896 [2025-03-08 06:26:52,725 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-08 06:26:52,729 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 4561 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:52,729 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.6s Time] [2025-03-08 06:26:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-08 06:26:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2025-03-08 06:26:52,800 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-08 06:26:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1145 transitions. [2025-03-08 06:26:52,809 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1145 transitions. Word has length 86 [2025-03-08 06:26:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:52,809 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1145 transitions. [2025-03-08 06:26:52,810 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-08 06:26:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1145 transitions. [2025-03-08 06:26:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 06:26:52,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:52,814 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-08 06:26:52,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:26:52,815 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-08 06:26:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 69278776, now seen corresponding path program 1 times [2025-03-08 06:26:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238515821] [2025-03-08 06:26:52,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:52,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 06:26:52,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 06:26:52,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:52,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:53,058 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-08 06:26:53,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:53,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238515821] [2025-03-08 06:26:53,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238515821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:53,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:53,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565877980] [2025-03-08 06:26:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:53,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:53,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:53,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:53,060 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-08 06:26:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:53,644 INFO L93 Difference]: Finished difference Result 1819 states and 2410 transitions. [2025-03-08 06:26:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:53,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-08 06:26:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:53,651 INFO L225 Difference]: With dead ends: 1819 [2025-03-08 06:26:53,651 INFO L226 Difference]: Without dead ends: 1107 [2025-03-08 06:26:53,652 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-08 06:26:53,654 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-08 06:26:53,655 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-08 06:26:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-08 06:26:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1027. [2025-03-08 06:26:53,680 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-08 06:26:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1396 transitions. [2025-03-08 06:26:53,684 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1396 transitions. Word has length 87 [2025-03-08 06:26:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:53,684 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1396 transitions. [2025-03-08 06:26:53,684 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-08 06:26:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1396 transitions. [2025-03-08 06:26:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:26:53,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:53,689 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-08 06:26:53,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:26:53,690 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-08 06:26:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -268723849, now seen corresponding path program 1 times [2025-03-08 06:26:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577002406] [2025-03-08 06:26:53,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:26:53,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:26:53,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:53,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:53,867 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-08 06:26:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577002406] [2025-03-08 06:26:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577002406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:53,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245404032] [2025-03-08 06:26:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:53,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:53,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:53,869 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-08 06:26:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:54,222 INFO L93 Difference]: Finished difference Result 1870 states and 2593 transitions. [2025-03-08 06:26:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:54,223 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-08 06:26:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:54,226 INFO L225 Difference]: With dead ends: 1870 [2025-03-08 06:26:54,226 INFO L226 Difference]: Without dead ends: 960 [2025-03-08 06:26:54,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-08 06:26:54,232 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:54,233 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.3s Time] [2025-03-08 06:26:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-08 06:26:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2025-03-08 06:26:54,247 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-08 06:26:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1319 transitions. [2025-03-08 06:26:54,249 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1319 transitions. Word has length 88 [2025-03-08 06:26:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:54,250 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1319 transitions. [2025-03-08 06:26:54,250 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-08 06:26:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1319 transitions. [2025-03-08 06:26:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:26:54,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:54,255 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-08 06:26:54,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:26:54,256 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-08 06:26:54,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1858053616, now seen corresponding path program 1 times [2025-03-08 06:26:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:54,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428747023] [2025-03-08 06:26:54,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:54,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:54,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:26:54,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:26:54,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:54,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:54,418 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-08 06:26:54,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428747023] [2025-03-08 06:26:54,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428747023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:54,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:54,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418155066] [2025-03-08 06:26:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:54,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:54,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:54,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:54,420 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-08 06:26:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:54,871 INFO L93 Difference]: Finished difference Result 1803 states and 2514 transitions. [2025-03-08 06:26:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:54,872 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-08 06:26:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:54,876 INFO L225 Difference]: With dead ends: 1803 [2025-03-08 06:26:54,876 INFO L226 Difference]: Without dead ends: 940 [2025-03-08 06:26:54,877 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-08 06:26:54,879 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-08 06:26:54,879 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-08 06:26:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-08 06:26:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2025-03-08 06:26:54,901 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-08 06:26:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1293 transitions. [2025-03-08 06:26:54,905 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1293 transitions. Word has length 89 [2025-03-08 06:26:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:54,905 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1293 transitions. [2025-03-08 06:26:54,905 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-08 06:26:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1293 transitions. [2025-03-08 06:26:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:26:54,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:54,909 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-08 06:26:54,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:26:54,909 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-08 06:26:54,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1868455409, now seen corresponding path program 1 times [2025-03-08 06:26:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865523401] [2025-03-08 06:26:54,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:54,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:26:54,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:26:54,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:54,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:55,075 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-08 06:26:55,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:55,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865523401] [2025-03-08 06:26:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865523401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:55,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606901348] [2025-03-08 06:26:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:55,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:55,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:55,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:55,077 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-08 06:26:55,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:55,434 INFO L93 Difference]: Finished difference Result 1783 states and 2486 transitions. [2025-03-08 06:26:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:55,434 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-08 06:26:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:55,437 INFO L225 Difference]: With dead ends: 1783 [2025-03-08 06:26:55,437 INFO L226 Difference]: Without dead ends: 918 [2025-03-08 06:26:55,439 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-08 06:26:55,439 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 2518 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 06:26:55,439 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-08 06:26:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-08 06:26:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2025-03-08 06:26:55,452 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-08 06:26:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1267 transitions. [2025-03-08 06:26:55,455 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1267 transitions. Word has length 90 [2025-03-08 06:26:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:55,455 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1267 transitions. [2025-03-08 06:26:55,455 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-08 06:26:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1267 transitions. [2025-03-08 06:26:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:26:55,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:55,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] [2025-03-08 06:26:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:26:55,457 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-08 06:26:55,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2057995368, now seen corresponding path program 1 times [2025-03-08 06:26:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040116680] [2025-03-08 06:26:55,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:55,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:26:55,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:26:55,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:55,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:55,564 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-08 06:26:55,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040116680] [2025-03-08 06:26:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040116680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:55,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625309326] [2025-03-08 06:26:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:55,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:55,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:55,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:55,565 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-08 06:26:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:55,941 INFO L93 Difference]: Finished difference Result 1761 states and 2458 transitions. [2025-03-08 06:26:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:55,942 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-08 06:26:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:55,944 INFO L225 Difference]: With dead ends: 1761 [2025-03-08 06:26:55,944 INFO L226 Difference]: Without dead ends: 910 [2025-03-08 06:26:55,945 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-08 06:26:55,945 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-08 06:26:55,945 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-08 06:26:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-08 06:26:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2025-03-08 06:26:55,958 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-08 06:26:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1256 transitions. [2025-03-08 06:26:55,960 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1256 transitions. Word has length 91 [2025-03-08 06:26:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:55,961 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1256 transitions. [2025-03-08 06:26:55,961 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-08 06:26:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1256 transitions. [2025-03-08 06:26:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:26:55,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:55,962 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-08 06:26:55,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:26:55,962 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-08 06:26:55,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash -197132569, now seen corresponding path program 1 times [2025-03-08 06:26:55,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:55,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296106677] [2025-03-08 06:26:55,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:55,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:26:56,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:26:56,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:56,326 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-08 06:26:56,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:56,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296106677] [2025-03-08 06:26:56,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296106677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:56,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:56,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:26:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524554549] [2025-03-08 06:26:56,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:56,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:26:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:56,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:26:56,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:26:56,328 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-08 06:26:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:57,377 INFO L93 Difference]: Finished difference Result 1659 states and 2288 transitions. [2025-03-08 06:26:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:57,378 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-08 06:26:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:57,381 INFO L225 Difference]: With dead ends: 1659 [2025-03-08 06:26:57,381 INFO L226 Difference]: Without dead ends: 1257 [2025-03-08 06:26:57,382 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-08 06:26:57,383 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-08 06:26:57,384 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-08 06:26:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-03-08 06:26:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 910. [2025-03-08 06:26:57,397 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-08 06:26:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1254 transitions. [2025-03-08 06:26:57,399 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1254 transitions. Word has length 92 [2025-03-08 06:26:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:57,399 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1254 transitions. [2025-03-08 06:26:57,400 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-08 06:26:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1254 transitions. [2025-03-08 06:26:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:26:57,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:57,401 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-08 06:26:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:26:57,401 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-08 06:26:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 914522256, now seen corresponding path program 1 times [2025-03-08 06:26:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761030257] [2025-03-08 06:26:57,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:57,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:26:57,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:26:57,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:57,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:57,769 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-08 06:26:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761030257] [2025-03-08 06:26:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761030257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:26:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307825948] [2025-03-08 06:26:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:26:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:26:57,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:26:57,772 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-08 06:26:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:58,616 INFO L93 Difference]: Finished difference Result 1659 states and 2224 transitions. [2025-03-08 06:26:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:26:58,617 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-08 06:26:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:58,620 INFO L225 Difference]: With dead ends: 1659 [2025-03-08 06:26:58,620 INFO L226 Difference]: Without dead ends: 1239 [2025-03-08 06:26:58,621 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-08 06:26:58,621 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-08 06:26:58,621 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-08 06:26:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-08 06:26:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 910. [2025-03-08 06:26:58,633 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-08 06:26:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1253 transitions. [2025-03-08 06:26:58,634 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1253 transitions. Word has length 92 [2025-03-08 06:26:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:58,634 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1253 transitions. [2025-03-08 06:26:58,634 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-08 06:26:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1253 transitions. [2025-03-08 06:26:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:26:58,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:58,637 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-08 06:26:58,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:26:58,637 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-08 06:26:58,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1915090164, now seen corresponding path program 1 times [2025-03-08 06:26:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945370357] [2025-03-08 06:26:58,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:58,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:26:58,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:26:58,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:58,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:58,937 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-08 06:26:58,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945370357] [2025-03-08 06:26:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945370357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:58,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:58,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155661181] [2025-03-08 06:26:58,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:58,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:58,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:58,939 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-08 06:26:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:59,977 INFO L93 Difference]: Finished difference Result 1636 states and 2279 transitions. [2025-03-08 06:26:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:59,978 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-08 06:26:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:59,982 INFO L225 Difference]: With dead ends: 1636 [2025-03-08 06:26:59,982 INFO L226 Difference]: Without dead ends: 1438 [2025-03-08 06:26:59,982 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-08 06:26:59,983 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 3715 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-08 06:26:59,983 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-08 06:26:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-03-08 06:26:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 910. [2025-03-08 06:26:59,994 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-08 06:26:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1252 transitions. [2025-03-08 06:26:59,996 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1252 transitions. Word has length 92 [2025-03-08 06:26:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:59,996 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1252 transitions. [2025-03-08 06:26:59,996 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-08 06:26:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1252 transitions. [2025-03-08 06:26:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:26:59,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:59,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] [2025-03-08 06:26:59,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:26:59,997 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-08 06:26:59,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash -284718186, now seen corresponding path program 1 times [2025-03-08 06:26:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020567327] [2025-03-08 06:26:59,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:00,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:27:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:27:00,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:00,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:00,303 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-08 06:27:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020567327] [2025-03-08 06:27:00,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020567327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:00,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:00,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:00,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793330723] [2025-03-08 06:27:00,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:00,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:00,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:00,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:00,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:00,305 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-08 06:27:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:01,178 INFO L93 Difference]: Finished difference Result 1256 states and 1749 transitions. [2025-03-08 06:27:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:01,178 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-08 06:27:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:01,181 INFO L225 Difference]: With dead ends: 1256 [2025-03-08 06:27:01,181 INFO L226 Difference]: Without dead ends: 989 [2025-03-08 06:27:01,182 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-08 06:27:01,182 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:01,182 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.8s Time] [2025-03-08 06:27:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-08 06:27:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 910. [2025-03-08 06:27:01,193 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-08 06:27:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1251 transitions. [2025-03-08 06:27:01,195 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1251 transitions. Word has length 92 [2025-03-08 06:27:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:01,195 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1251 transitions. [2025-03-08 06:27:01,195 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-08 06:27:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1251 transitions. [2025-03-08 06:27:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:27:01,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:01,197 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-08 06:27:01,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:27:01,197 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-08 06:27:01,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash -357558250, now seen corresponding path program 1 times [2025-03-08 06:27:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:01,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144048639] [2025-03-08 06:27:01,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:01,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:01,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:27:01,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:27:01,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:01,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:01,636 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-08 06:27:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144048639] [2025-03-08 06:27:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144048639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:01,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:01,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106710415] [2025-03-08 06:27:01,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:01,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:01,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:01,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:01,637 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-08 06:27:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:03,159 INFO L93 Difference]: Finished difference Result 2262 states and 3191 transitions. [2025-03-08 06:27:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:03,159 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-08 06:27:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:03,167 INFO L225 Difference]: With dead ends: 2262 [2025-03-08 06:27:03,167 INFO L226 Difference]: Without dead ends: 2050 [2025-03-08 06:27:03,168 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-08 06:27:03,168 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-08 06:27:03,168 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-08 06:27:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-03-08 06:27:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 914. [2025-03-08 06:27:03,183 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-08 06:27:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1255 transitions. [2025-03-08 06:27:03,185 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1255 transitions. Word has length 94 [2025-03-08 06:27:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:03,185 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1255 transitions. [2025-03-08 06:27:03,185 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-08 06:27:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1255 transitions. [2025-03-08 06:27:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:27:03,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:03,187 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-08 06:27:03,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:27:03,187 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-08 06:27:03,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash 901655269, now seen corresponding path program 1 times [2025-03-08 06:27:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506144184] [2025-03-08 06:27:03,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:03,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:27:03,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:27:03,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:03,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:03,480 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-08 06:27:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:03,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506144184] [2025-03-08 06:27:03,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506144184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:03,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:03,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624567978] [2025-03-08 06:27:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:03,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:03,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:03,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:03,482 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-08 06:27:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:04,367 INFO L93 Difference]: Finished difference Result 1587 states and 2198 transitions. [2025-03-08 06:27:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:04,367 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-08 06:27:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:04,370 INFO L225 Difference]: With dead ends: 1587 [2025-03-08 06:27:04,370 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 06:27:04,371 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-08 06:27:04,371 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:04,371 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.8s Time] [2025-03-08 06:27:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 06:27:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 914. [2025-03-08 06:27:04,385 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-08 06:27:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1254 transitions. [2025-03-08 06:27:04,387 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1254 transitions. Word has length 94 [2025-03-08 06:27:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:04,387 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1254 transitions. [2025-03-08 06:27:04,387 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-08 06:27:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1254 transitions. [2025-03-08 06:27:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:27:04,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:04,389 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-08 06:27:04,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:27:04,389 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-08 06:27:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash 55491476, now seen corresponding path program 1 times [2025-03-08 06:27:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51474069] [2025-03-08 06:27:04,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:04,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:27:04,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:27:04,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:04,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:04,767 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-08 06:27:04,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:04,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51474069] [2025-03-08 06:27:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51474069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:04,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:04,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265381588] [2025-03-08 06:27:04,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:04,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:04,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:04,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:04,768 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-08 06:27:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:06,014 INFO L93 Difference]: Finished difference Result 2119 states and 2976 transitions. [2025-03-08 06:27:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:06,015 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-08 06:27:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:06,020 INFO L225 Difference]: With dead ends: 2119 [2025-03-08 06:27:06,020 INFO L226 Difference]: Without dead ends: 1946 [2025-03-08 06:27:06,021 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-08 06:27:06,021 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 6703 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:06,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6703 Valid, 2463 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:27:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2025-03-08 06:27:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 918. [2025-03-08 06:27:06,032 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-08 06:27:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1258 transitions. [2025-03-08 06:27:06,034 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1258 transitions. Word has length 94 [2025-03-08 06:27:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:06,034 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1258 transitions. [2025-03-08 06:27:06,034 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-08 06:27:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1258 transitions. [2025-03-08 06:27:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:27:06,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:06,035 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-08 06:27:06,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:27:06,036 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-08 06:27:06,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash 837475690, now seen corresponding path program 1 times [2025-03-08 06:27:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466681694] [2025-03-08 06:27:06,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:06,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:27:06,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:27:06,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:06,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:06,240 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-08 06:27:06,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466681694] [2025-03-08 06:27:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466681694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:06,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669425076] [2025-03-08 06:27:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:06,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:06,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:06,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:06,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:06,245 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-08 06:27:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:07,067 INFO L93 Difference]: Finished difference Result 1582 states and 2191 transitions. [2025-03-08 06:27:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:07,068 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-08 06:27:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:07,070 INFO L225 Difference]: With dead ends: 1582 [2025-03-08 06:27:07,070 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 06:27:07,071 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-08 06:27:07,071 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 4672 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-08 06:27:07,071 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-08 06:27:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 06:27:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-08 06:27:07,080 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-08 06:27:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1257 transitions. [2025-03-08 06:27:07,081 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1257 transitions. Word has length 94 [2025-03-08 06:27:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:07,082 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1257 transitions. [2025-03-08 06:27:07,082 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-08 06:27:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1257 transitions. [2025-03-08 06:27:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:27:07,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:07,083 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-08 06:27:07,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:27:07,083 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-08 06:27:07,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1831608880, now seen corresponding path program 1 times [2025-03-08 06:27:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:07,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296721273] [2025-03-08 06:27:07,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:07,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:27:07,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:27:07,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:07,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:07,298 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-08 06:27:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296721273] [2025-03-08 06:27:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296721273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:07,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:07,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:07,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500237228] [2025-03-08 06:27:07,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:07,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:07,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:07,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:07,299 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-08 06:27:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:08,270 INFO L93 Difference]: Finished difference Result 1688 states and 2340 transitions. [2025-03-08 06:27:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:08,271 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-08 06:27:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:08,274 INFO L225 Difference]: With dead ends: 1688 [2025-03-08 06:27:08,274 INFO L226 Difference]: Without dead ends: 1442 [2025-03-08 06:27:08,275 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-08 06:27:08,275 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-08 06:27:08,275 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-08 06:27:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-08 06:27:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 918. [2025-03-08 06:27:08,283 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-08 06:27:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1255 transitions. [2025-03-08 06:27:08,284 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1255 transitions. Word has length 94 [2025-03-08 06:27:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:08,284 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1255 transitions. [2025-03-08 06:27:08,284 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-08 06:27:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1255 transitions. [2025-03-08 06:27:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:27:08,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:08,286 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-08 06:27:08,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:27:08,286 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-08 06:27:08,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:08,286 INFO L85 PathProgramCache]: Analyzing trace with hash -572395361, now seen corresponding path program 1 times [2025-03-08 06:27:08,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:08,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743306076] [2025-03-08 06:27:08,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:08,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:27:08,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:27:08,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:08,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:08,536 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-08 06:27:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743306076] [2025-03-08 06:27:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743306076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502793886] [2025-03-08 06:27:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:08,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:08,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:08,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:08,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:08,539 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-08 06:27:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:09,390 INFO L93 Difference]: Finished difference Result 1606 states and 2220 transitions. [2025-03-08 06:27:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:09,391 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-08 06:27:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:09,394 INFO L225 Difference]: With dead ends: 1606 [2025-03-08 06:27:09,394 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 06:27:09,394 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-08 06:27:09,395 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:09,395 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.8s Time] [2025-03-08 06:27:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 06:27:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-08 06:27:09,403 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-08 06:27:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1253 transitions. [2025-03-08 06:27:09,404 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1253 transitions. Word has length 94 [2025-03-08 06:27:09,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:09,404 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1253 transitions. [2025-03-08 06:27:09,404 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-08 06:27:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1253 transitions. [2025-03-08 06:27:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:27:09,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:09,405 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-08 06:27:09,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:27:09,406 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-08 06:27:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1466825864, now seen corresponding path program 1 times [2025-03-08 06:27:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:09,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352202828] [2025-03-08 06:27:09,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:09,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:09,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:27:09,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:27:09,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:09,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:09,577 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-08 06:27:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:09,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352202828] [2025-03-08 06:27:09,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352202828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:09,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395759157] [2025-03-08 06:27:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:09,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:09,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:09,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:09,578 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-08 06:27:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:10,268 INFO L93 Difference]: Finished difference Result 1351 states and 1820 transitions. [2025-03-08 06:27:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:10,269 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-08 06:27:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:10,272 INFO L225 Difference]: With dead ends: 1351 [2025-03-08 06:27:10,272 INFO L226 Difference]: Without dead ends: 1346 [2025-03-08 06:27:10,272 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-08 06:27:10,272 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-08 06:27:10,273 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-08 06:27:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-08 06:27:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 918. [2025-03-08 06:27:10,280 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-08 06:27:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1252 transitions. [2025-03-08 06:27:10,281 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1252 transitions. Word has length 95 [2025-03-08 06:27:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:10,281 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1252 transitions. [2025-03-08 06:27:10,281 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-08 06:27:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1252 transitions. [2025-03-08 06:27:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:27:10,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:10,282 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-08 06:27:10,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:27:10,283 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-08 06:27:10,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2034222567, now seen corresponding path program 1 times [2025-03-08 06:27:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:10,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637534946] [2025-03-08 06:27:10,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:10,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:27:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:27:10,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:10,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:10,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-08 06:27:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637534946] [2025-03-08 06:27:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637534946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:10,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:10,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918001297] [2025-03-08 06:27:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:10,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:10,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:10,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:10,436 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-08 06:27:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:11,275 INFO L93 Difference]: Finished difference Result 1654 states and 2286 transitions. [2025-03-08 06:27:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:11,275 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-08 06:27:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:11,278 INFO L225 Difference]: With dead ends: 1654 [2025-03-08 06:27:11,278 INFO L226 Difference]: Without dead ends: 1442 [2025-03-08 06:27:11,279 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-08 06:27:11,279 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-08 06:27:11,279 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-08 06:27:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-08 06:27:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 914. [2025-03-08 06:27:11,286 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-08 06:27:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1247 transitions. [2025-03-08 06:27:11,287 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1247 transitions. Word has length 95 [2025-03-08 06:27:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:11,287 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1247 transitions. [2025-03-08 06:27:11,288 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-08 06:27:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1247 transitions. [2025-03-08 06:27:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:11,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:11,292 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-08 06:27:11,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:27:11,292 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-08 06:27:11,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash -383543387, now seen corresponding path program 1 times [2025-03-08 06:27:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093490206] [2025-03-08 06:27:11,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:11,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:11,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:11,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:11,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:11,664 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-08 06:27:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093490206] [2025-03-08 06:27:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093490206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:11,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:11,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575789504] [2025-03-08 06:27:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:11,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:11,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:11,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:11,665 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-08 06:27:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:12,853 INFO L93 Difference]: Finished difference Result 2002 states and 2788 transitions. [2025-03-08 06:27:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:12,854 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-08 06:27:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:12,859 INFO L225 Difference]: With dead ends: 2002 [2025-03-08 06:27:12,859 INFO L226 Difference]: Without dead ends: 1842 [2025-03-08 06:27:12,859 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-08 06:27:12,860 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 6531 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-08 06:27:12,860 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-08 06:27:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-08 06:27:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 918. [2025-03-08 06:27:12,874 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-08 06:27:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1251 transitions. [2025-03-08 06:27:12,876 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1251 transitions. Word has length 96 [2025-03-08 06:27:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:12,876 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1251 transitions. [2025-03-08 06:27:12,876 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-08 06:27:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1251 transitions. [2025-03-08 06:27:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:12,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:12,877 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-08 06:27:12,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:27:12,877 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-08 06:27:12,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 408333678, now seen corresponding path program 1 times [2025-03-08 06:27:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:12,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076038185] [2025-03-08 06:27:12,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:12,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:12,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:12,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:12,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:13,149 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-08 06:27:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076038185] [2025-03-08 06:27:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076038185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:13,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487943910] [2025-03-08 06:27:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:13,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:13,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:13,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:13,151 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-08 06:27:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:13,936 INFO L93 Difference]: Finished difference Result 1546 states and 2123 transitions. [2025-03-08 06:27:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:13,937 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-08 06:27:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:13,941 INFO L225 Difference]: With dead ends: 1546 [2025-03-08 06:27:13,941 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 06:27:13,942 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-08 06:27:13,942 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-08 06:27:13,942 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-08 06:27:13,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 06:27:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-08 06:27:13,952 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-08 06:27:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1250 transitions. [2025-03-08 06:27:13,954 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1250 transitions. Word has length 96 [2025-03-08 06:27:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:13,954 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1250 transitions. [2025-03-08 06:27:13,954 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-08 06:27:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1250 transitions. [2025-03-08 06:27:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:13,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:13,955 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-08 06:27:13,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:27:13,956 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-08 06:27:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash -603509994, now seen corresponding path program 1 times [2025-03-08 06:27:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:13,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924641413] [2025-03-08 06:27:13,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:13,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:13,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:13,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:14,116 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-08 06:27:14,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:14,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924641413] [2025-03-08 06:27:14,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924641413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:14,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:14,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328924073] [2025-03-08 06:27:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:14,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:14,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:14,130 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-08 06:27:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:14,975 INFO L93 Difference]: Finished difference Result 1596 states and 2195 transitions. [2025-03-08 06:27:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:14,975 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-08 06:27:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:14,978 INFO L225 Difference]: With dead ends: 1596 [2025-03-08 06:27:14,978 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 06:27:14,979 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-08 06:27:14,979 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 3799 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-08 06:27:14,980 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-08 06:27:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 06:27:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-08 06:27:14,988 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-08 06:27:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1249 transitions. [2025-03-08 06:27:14,989 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1249 transitions. Word has length 96 [2025-03-08 06:27:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:14,989 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1249 transitions. [2025-03-08 06:27:14,989 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-08 06:27:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1249 transitions. [2025-03-08 06:27:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:14,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:14,990 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-08 06:27:14,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:27:14,991 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-08 06:27:14,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash -377088797, now seen corresponding path program 1 times [2025-03-08 06:27:14,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:14,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449871172] [2025-03-08 06:27:14,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:15,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:15,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:15,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:15,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:15,192 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-08 06:27:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:15,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449871172] [2025-03-08 06:27:15,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449871172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:15,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:15,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871774808] [2025-03-08 06:27:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:15,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:15,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:15,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:15,194 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-08 06:27:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:15,989 INFO L93 Difference]: Finished difference Result 1550 states and 2125 transitions. [2025-03-08 06:27:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:15,992 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-08 06:27:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:15,995 INFO L225 Difference]: With dead ends: 1550 [2025-03-08 06:27:15,995 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 06:27:15,995 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-08 06:27:15,997 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 3741 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:15,997 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.7s Time] [2025-03-08 06:27:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 06:27:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-08 06:27:16,007 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-08 06:27:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1248 transitions. [2025-03-08 06:27:16,008 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1248 transitions. Word has length 96 [2025-03-08 06:27:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:16,009 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1248 transitions. [2025-03-08 06:27:16,009 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-08 06:27:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1248 transitions. [2025-03-08 06:27:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:16,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:16,010 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-08 06:27:16,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:27:16,010 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-08 06:27:16,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1006391796, now seen corresponding path program 1 times [2025-03-08 06:27:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945238076] [2025-03-08 06:27:16,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:16,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:16,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:16,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:16,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:16,222 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-08 06:27:16,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945238076] [2025-03-08 06:27:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945238076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:16,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454868985] [2025-03-08 06:27:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:16,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:16,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:16,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:16,226 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-08 06:27:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:16,986 INFO L93 Difference]: Finished difference Result 1546 states and 2120 transitions. [2025-03-08 06:27:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:16,986 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-08 06:27:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:16,989 INFO L225 Difference]: With dead ends: 1546 [2025-03-08 06:27:16,989 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 06:27:16,989 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-08 06:27:16,994 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:16,994 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.7s Time] [2025-03-08 06:27:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 06:27:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-08 06:27:17,006 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-08 06:27:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1247 transitions. [2025-03-08 06:27:17,007 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1247 transitions. Word has length 96 [2025-03-08 06:27:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:17,007 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1247 transitions. [2025-03-08 06:27:17,008 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-08 06:27:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1247 transitions. [2025-03-08 06:27:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:17,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:17,009 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-08 06:27:17,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:27:17,009 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-08 06:27:17,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1108277290, now seen corresponding path program 1 times [2025-03-08 06:27:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770478580] [2025-03-08 06:27:17,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:17,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:17,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:17,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:17,288 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-08 06:27:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770478580] [2025-03-08 06:27:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770478580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536297900] [2025-03-08 06:27:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:17,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:17,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:17,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:17,291 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-08 06:27:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:18,070 INFO L93 Difference]: Finished difference Result 1546 states and 2119 transitions. [2025-03-08 06:27:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:18,070 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-08 06:27:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:18,072 INFO L225 Difference]: With dead ends: 1546 [2025-03-08 06:27:18,072 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 06:27:18,072 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-08 06:27:18,073 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 2917 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-08 06:27:18,073 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-08 06:27:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 06:27:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-08 06:27:18,079 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-08 06:27:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1246 transitions. [2025-03-08 06:27:18,080 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1246 transitions. Word has length 96 [2025-03-08 06:27:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:18,080 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1246 transitions. [2025-03-08 06:27:18,080 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-08 06:27:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1246 transitions. [2025-03-08 06:27:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:18,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:18,081 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-08 06:27:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:27:18,082 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-08 06:27:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1269274821, now seen corresponding path program 1 times [2025-03-08 06:27:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577439482] [2025-03-08 06:27:18,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:18,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:18,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:18,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:18,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:18,237 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-08 06:27:18,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:18,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577439482] [2025-03-08 06:27:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577439482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:18,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092270106] [2025-03-08 06:27:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:18,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:18,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:18,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:18,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:18,239 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-08 06:27:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:18,913 INFO L93 Difference]: Finished difference Result 1494 states and 2028 transitions. [2025-03-08 06:27:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:18,913 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-08 06:27:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:18,916 INFO L225 Difference]: With dead ends: 1494 [2025-03-08 06:27:18,916 INFO L226 Difference]: Without dead ends: 1346 [2025-03-08 06:27:18,917 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-08 06:27:18,917 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 3342 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:18,917 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.6s Time] [2025-03-08 06:27:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-08 06:27:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 918. [2025-03-08 06:27:18,927 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-08 06:27:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1245 transitions. [2025-03-08 06:27:18,928 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1245 transitions. Word has length 96 [2025-03-08 06:27:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:18,928 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1245 transitions. [2025-03-08 06:27:18,928 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-08 06:27:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1245 transitions. [2025-03-08 06:27:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:18,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:18,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, 1, 1] [2025-03-08 06:27:18,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:27:18,930 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-08 06:27:18,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 173031760, now seen corresponding path program 1 times [2025-03-08 06:27:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:18,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428197314] [2025-03-08 06:27:18,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:18,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:18,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:18,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:18,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,189 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-08 06:27:19,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428197314] [2025-03-08 06:27:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428197314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402189273] [2025-03-08 06:27:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:19,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:19,191 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-08 06:27:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,961 INFO L93 Difference]: Finished difference Result 1606 states and 2201 transitions. [2025-03-08 06:27:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:19,962 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-08 06:27:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,963 INFO L225 Difference]: With dead ends: 1606 [2025-03-08 06:27:19,963 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 06:27:19,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:27:19,964 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-08 06:27:19,964 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-08 06:27:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 06:27:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 918. [2025-03-08 06:27:19,971 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-08 06:27:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1243 transitions. [2025-03-08 06:27:19,971 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1243 transitions. Word has length 96 [2025-03-08 06:27:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,972 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1243 transitions. [2025-03-08 06:27:19,972 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-08 06:27:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1243 transitions. [2025-03-08 06:27:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:19,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,973 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-08 06:27:19,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:27:19,973 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-08 06:27:19,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,973 INFO L85 PathProgramCache]: Analyzing trace with hash 399452957, now seen corresponding path program 1 times [2025-03-08 06:27:19,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802568058] [2025-03-08 06:27:19,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:20,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:20,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:20,141 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-08 06:27:20,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802568058] [2025-03-08 06:27:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802568058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:20,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801323446] [2025-03-08 06:27:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:20,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:20,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:20,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:20,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:20,143 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-08 06:27:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:20,816 INFO L93 Difference]: Finished difference Result 1556 states and 2126 transitions. [2025-03-08 06:27:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:20,816 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-08 06:27:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:20,818 INFO L225 Difference]: With dead ends: 1556 [2025-03-08 06:27:20,818 INFO L226 Difference]: Without dead ends: 1390 [2025-03-08 06:27:20,818 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-08 06:27:20,819 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-08 06:27:20,819 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-08 06:27:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-03-08 06:27:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 918. [2025-03-08 06:27:20,825 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-08 06:27:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1241 transitions. [2025-03-08 06:27:20,826 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1241 transitions. Word has length 96 [2025-03-08 06:27:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:20,826 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1241 transitions. [2025-03-08 06:27:20,826 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-08 06:27:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1241 transitions. [2025-03-08 06:27:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:20,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:20,827 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-08 06:27:20,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:27:20,827 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-08 06:27:20,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash 392998367, now seen corresponding path program 1 times [2025-03-08 06:27:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503669333] [2025-03-08 06:27:20,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:20,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:20,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:20,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:21,130 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-08 06:27:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503669333] [2025-03-08 06:27:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503669333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:21,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:21,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709303077] [2025-03-08 06:27:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:21,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:21,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:21,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:21,132 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-08 06:27:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:22,260 INFO L93 Difference]: Finished difference Result 2008 states and 2784 transitions. [2025-03-08 06:27:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:22,261 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-08 06:27:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:22,263 INFO L225 Difference]: With dead ends: 2008 [2025-03-08 06:27:22,263 INFO L226 Difference]: Without dead ends: 1842 [2025-03-08 06:27:22,264 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-08 06:27:22,264 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.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:22,265 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.9s Time] [2025-03-08 06:27:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-08 06:27:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 926. [2025-03-08 06:27:22,273 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-08 06:27:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1249 transitions. [2025-03-08 06:27:22,274 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1249 transitions. Word has length 96 [2025-03-08 06:27:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:22,274 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1249 transitions. [2025-03-08 06:27:22,274 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-08 06:27:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1249 transitions. [2025-03-08 06:27:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:22,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:22,275 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-08 06:27:22,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:27:22,275 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-08 06:27:22,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1185201136, now seen corresponding path program 1 times [2025-03-08 06:27:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738062930] [2025-03-08 06:27:22,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:22,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:22,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:22,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:22,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:22,453 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-08 06:27:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:22,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738062930] [2025-03-08 06:27:22,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738062930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:22,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:22,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350096588] [2025-03-08 06:27:22,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:22,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:22,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:22,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:22,455 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-08 06:27:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:23,087 INFO L93 Difference]: Finished difference Result 1506 states and 2034 transitions. [2025-03-08 06:27:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:23,088 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-08 06:27:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:23,090 INFO L225 Difference]: With dead ends: 1506 [2025-03-08 06:27:23,090 INFO L226 Difference]: Without dead ends: 1354 [2025-03-08 06:27:23,090 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-08 06:27:23,090 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-08 06:27:23,090 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-08 06:27:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-08 06:27:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 926. [2025-03-08 06:27:23,096 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-08 06:27:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1247 transitions. [2025-03-08 06:27:23,097 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1247 transitions. Word has length 96 [2025-03-08 06:27:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:23,097 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1247 transitions. [2025-03-08 06:27:23,097 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-08 06:27:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1247 transitions. [2025-03-08 06:27:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:23,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:23,098 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-08 06:27:23,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:27:23,098 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-08 06:27:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash -991121145, now seen corresponding path program 1 times [2025-03-08 06:27:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592232602] [2025-03-08 06:27:23,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:23,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:23,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:23,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:23,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:23,460 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-08 06:27:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:23,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592232602] [2025-03-08 06:27:23,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592232602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:23,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:23,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242786906] [2025-03-08 06:27:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:23,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:23,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:23,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:23,461 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-08 06:27:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:24,680 INFO L93 Difference]: Finished difference Result 2348 states and 3274 transitions. [2025-03-08 06:27:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:24,681 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-08 06:27:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:24,683 INFO L225 Difference]: With dead ends: 2348 [2025-03-08 06:27:24,683 INFO L226 Difference]: Without dead ends: 2070 [2025-03-08 06:27:24,684 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-08 06:27:24,685 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-08 06:27:24,685 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-08 06:27:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2025-03-08 06:27:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 934. [2025-03-08 06:27:24,692 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-08 06:27:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1255 transitions. [2025-03-08 06:27:24,693 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1255 transitions. Word has length 96 [2025-03-08 06:27:24,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:24,693 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1255 transitions. [2025-03-08 06:27:24,693 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-08 06:27:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1255 transitions. [2025-03-08 06:27:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:24,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:24,694 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-08 06:27:24,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:27:24,694 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-08 06:27:24,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1411014962, now seen corresponding path program 1 times [2025-03-08 06:27:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494128658] [2025-03-08 06:27:24,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:24,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:24,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:24,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:24,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:24,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-08 06:27:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494128658] [2025-03-08 06:27:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494128658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586946680] [2025-03-08 06:27:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:24,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:24,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:24,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:24,959 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-08 06:27:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:25,692 INFO L93 Difference]: Finished difference Result 1634 states and 2226 transitions. [2025-03-08 06:27:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:25,692 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-08 06:27:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:25,694 INFO L225 Difference]: With dead ends: 1634 [2025-03-08 06:27:25,694 INFO L226 Difference]: Without dead ends: 1430 [2025-03-08 06:27:25,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:27:25,695 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-08 06:27:25,695 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-08 06:27:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-03-08 06:27:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 934. [2025-03-08 06:27:25,702 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-08 06:27:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1253 transitions. [2025-03-08 06:27:25,702 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1253 transitions. Word has length 96 [2025-03-08 06:27:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1253 transitions. [2025-03-08 06:27:25,703 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-08 06:27:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1253 transitions. [2025-03-08 06:27:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:27:25,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:25,704 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-08 06:27:25,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:27:25,704 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-08 06:27:25,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1184593765, now seen corresponding path program 1 times [2025-03-08 06:27:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:25,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765815410] [2025-03-08 06:27:25,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:25,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:27:25,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:27:25,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:25,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:25,859 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-08 06:27:25,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:25,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765815410] [2025-03-08 06:27:25,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765815410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:25,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194714675] [2025-03-08 06:27:25,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:25,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:25,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:25,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:25,860 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-08 06:27:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:26,555 INFO L93 Difference]: Finished difference Result 1568 states and 2132 transitions. [2025-03-08 06:27:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:26,556 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-08 06:27:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:26,558 INFO L225 Difference]: With dead ends: 1568 [2025-03-08 06:27:26,558 INFO L226 Difference]: Without dead ends: 1398 [2025-03-08 06:27:26,558 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-08 06:27:26,558 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-08 06:27:26,558 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-08 06:27:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-08 06:27:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 934. [2025-03-08 06:27:26,568 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-08 06:27:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1251 transitions. [2025-03-08 06:27:26,569 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1251 transitions. Word has length 96 [2025-03-08 06:27:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:26,569 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1251 transitions. [2025-03-08 06:27:26,569 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-08 06:27:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1251 transitions. [2025-03-08 06:27:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:27:26,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:26,570 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-08 06:27:26,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:27:26,570 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-08 06:27:26,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash 574671180, now seen corresponding path program 1 times [2025-03-08 06:27:26,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:26,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305186474] [2025-03-08 06:27:26,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:26,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:26,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:27:26,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:27:26,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:26,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:26,765 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-08 06:27:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:26,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305186474] [2025-03-08 06:27:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305186474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372348613] [2025-03-08 06:27:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:26,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:26,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:26,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:26,767 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-08 06:27:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:27,558 INFO L93 Difference]: Finished difference Result 1558 states and 2116 transitions. [2025-03-08 06:27:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:27,561 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-08 06:27:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:27,564 INFO L225 Difference]: With dead ends: 1558 [2025-03-08 06:27:27,564 INFO L226 Difference]: Without dead ends: 1398 [2025-03-08 06:27:27,564 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-08 06:27:27,565 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:27,565 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.7s Time] [2025-03-08 06:27:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-08 06:27:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 930. [2025-03-08 06:27:27,572 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-08 06:27:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1246 transitions. [2025-03-08 06:27:27,573 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1246 transitions. Word has length 97 [2025-03-08 06:27:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1246 transitions. [2025-03-08 06:27:27,573 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-08 06:27:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1246 transitions. [2025-03-08 06:27:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:27:27,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:27,574 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-08 06:27:27,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:27:27,574 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-08 06:27:27,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2081182659, now seen corresponding path program 1 times [2025-03-08 06:27:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240272332] [2025-03-08 06:27:27,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:27,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:27:27,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:27:27,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:27,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:27,736 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-08 06:27:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:27,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240272332] [2025-03-08 06:27:27,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240272332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:27,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456668837] [2025-03-08 06:27:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:27,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:27,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:27,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:27,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:27,737 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-08 06:27:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:28,408 INFO L93 Difference]: Finished difference Result 1558 states and 2113 transitions. [2025-03-08 06:27:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:28,408 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-08 06:27:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:28,410 INFO L225 Difference]: With dead ends: 1558 [2025-03-08 06:27:28,410 INFO L226 Difference]: Without dead ends: 1398 [2025-03-08 06:27:28,411 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-08 06:27:28,411 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-08 06:27:28,411 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-08 06:27:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-08 06:27:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 930. [2025-03-08 06:27:28,432 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-08 06:27:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1245 transitions. [2025-03-08 06:27:28,433 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1245 transitions. Word has length 97 [2025-03-08 06:27:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:28,433 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1245 transitions. [2025-03-08 06:27:28,433 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-08 06:27:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1245 transitions. [2025-03-08 06:27:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:27:28,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:28,434 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-08 06:27:28,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:27:28,434 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-08 06:27:28,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 698371265, now seen corresponding path program 1 times [2025-03-08 06:27:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684297238] [2025-03-08 06:27:28,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:28,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:27:28,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:27:28,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:28,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:28,594 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-08 06:27:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684297238] [2025-03-08 06:27:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684297238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:28,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:28,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:28,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520150883] [2025-03-08 06:27:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:28,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:28,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:28,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:28,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:28,596 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-08 06:27:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:29,372 INFO L93 Difference]: Finished difference Result 1599 states and 2171 transitions. [2025-03-08 06:27:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:29,372 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-08 06:27:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:29,375 INFO L225 Difference]: With dead ends: 1599 [2025-03-08 06:27:29,375 INFO L226 Difference]: Without dead ends: 1426 [2025-03-08 06:27:29,376 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-08 06:27:29,377 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:29,377 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.7s Time] [2025-03-08 06:27:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-03-08 06:27:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 926. [2025-03-08 06:27:29,387 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-08 06:27:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1240 transitions. [2025-03-08 06:27:29,388 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1240 transitions. Word has length 97 [2025-03-08 06:27:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:29,388 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1240 transitions. [2025-03-08 06:27:29,389 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-08 06:27:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1240 transitions. [2025-03-08 06:27:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:27:29,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:29,390 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-08 06:27:29,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:27:29,390 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-08 06:27:29,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1122338550, now seen corresponding path program 1 times [2025-03-08 06:27:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596827117] [2025-03-08 06:27:29,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:29,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:27:29,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:27:29,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:29,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:29,595 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-08 06:27:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596827117] [2025-03-08 06:27:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596827117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209590752] [2025-03-08 06:27:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:29,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:29,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:29,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:29,597 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-08 06:27:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:30,308 INFO L93 Difference]: Finished difference Result 1560 states and 2116 transitions. [2025-03-08 06:27:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:30,308 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-08 06:27:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:30,310 INFO L225 Difference]: With dead ends: 1560 [2025-03-08 06:27:30,310 INFO L226 Difference]: Without dead ends: 1394 [2025-03-08 06:27:30,310 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-08 06:27:30,310 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-08 06:27:30,310 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-08 06:27:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-08 06:27:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 918. [2025-03-08 06:27:30,317 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-08 06:27:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1230 transitions. [2025-03-08 06:27:30,317 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1230 transitions. Word has length 97 [2025-03-08 06:27:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:30,318 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1230 transitions. [2025-03-08 06:27:30,318 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-08 06:27:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1230 transitions. [2025-03-08 06:27:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:27:30,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:30,319 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-08 06:27:30,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:27:30,319 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-08 06:27:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -726997041, now seen corresponding path program 1 times [2025-03-08 06:27:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552829475] [2025-03-08 06:27:30,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:30,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:27:30,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:27:30,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:30,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:30,491 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-08 06:27:30,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:30,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552829475] [2025-03-08 06:27:30,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552829475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421916368] [2025-03-08 06:27:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:30,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:30,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:30,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:30,493 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-08 06:27:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:31,383 INFO L93 Difference]: Finished difference Result 1716 states and 2338 transitions. [2025-03-08 06:27:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:31,383 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-08 06:27:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:31,385 INFO L225 Difference]: With dead ends: 1716 [2025-03-08 06:27:31,385 INFO L226 Difference]: Without dead ends: 1438 [2025-03-08 06:27:31,386 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-08 06:27:31,386 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 2537 mSDsluCounter, 2943 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:31,386 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.8s Time] [2025-03-08 06:27:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-03-08 06:27:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 910. [2025-03-08 06:27:31,393 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-08 06:27:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1220 transitions. [2025-03-08 06:27:31,394 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1220 transitions. Word has length 97 [2025-03-08 06:27:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:31,394 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1220 transitions. [2025-03-08 06:27:31,394 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-08 06:27:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1220 transitions. [2025-03-08 06:27:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:31,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:31,395 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-08 06:27:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:27:31,396 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-08 06:27:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 610120943, now seen corresponding path program 1 times [2025-03-08 06:27:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370019309] [2025-03-08 06:27:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:31,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:31,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:31,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:31,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:31,584 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-08 06:27:31,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370019309] [2025-03-08 06:27:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370019309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:31,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931772241] [2025-03-08 06:27:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:31,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:31,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:31,586 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-08 06:27:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:32,312 INFO L93 Difference]: Finished difference Result 1488 states and 2001 transitions. [2025-03-08 06:27:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:32,314 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-08 06:27:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:32,315 INFO L225 Difference]: With dead ends: 1488 [2025-03-08 06:27:32,315 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 06:27:32,316 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-08 06:27:32,316 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-08 06:27:32,316 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-08 06:27:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 06:27:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 910. [2025-03-08 06:27:32,322 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-08 06:27:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1219 transitions. [2025-03-08 06:27:32,323 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1219 transitions. Word has length 98 [2025-03-08 06:27:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:32,323 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1219 transitions. [2025-03-08 06:27:32,323 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-08 06:27:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1219 transitions. [2025-03-08 06:27:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:32,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:32,324 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-08 06:27:32,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:27:32,324 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-08 06:27:32,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash 232814629, now seen corresponding path program 1 times [2025-03-08 06:27:32,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:32,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286531862] [2025-03-08 06:27:32,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:32,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:32,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:32,635 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-08 06:27:32,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:32,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286531862] [2025-03-08 06:27:32,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286531862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:32,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:32,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:32,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229328797] [2025-03-08 06:27:32,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:32,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:32,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:32,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:32,637 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-08 06:27:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:33,657 INFO L93 Difference]: Finished difference Result 1863 states and 2543 transitions. [2025-03-08 06:27:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:33,657 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-08 06:27:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:33,659 INFO L225 Difference]: With dead ends: 1863 [2025-03-08 06:27:33,659 INFO L226 Difference]: Without dead ends: 1710 [2025-03-08 06:27:33,659 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-08 06:27:33,660 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-08 06:27:33,660 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-08 06:27:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-08 06:27:33,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 914. [2025-03-08 06:27:33,667 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-08 06:27:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1223 transitions. [2025-03-08 06:27:33,668 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1223 transitions. Word has length 98 [2025-03-08 06:27:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:33,668 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1223 transitions. [2025-03-08 06:27:33,668 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-08 06:27:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1223 transitions. [2025-03-08 06:27:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:33,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:33,669 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-08 06:27:33,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:27:33,670 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-08 06:27:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -963490226, now seen corresponding path program 1 times [2025-03-08 06:27:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357537591] [2025-03-08 06:27:33,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:33,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:33,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:33,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:33,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:33,951 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-08 06:27:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357537591] [2025-03-08 06:27:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357537591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:33,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:33,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:33,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159102968] [2025-03-08 06:27:33,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:33,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:33,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:33,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:33,953 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-08 06:27:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:35,061 INFO L93 Difference]: Finished difference Result 1860 states and 2539 transitions. [2025-03-08 06:27:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:35,062 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-08 06:27:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:35,064 INFO L225 Difference]: With dead ends: 1860 [2025-03-08 06:27:35,064 INFO L226 Difference]: Without dead ends: 1710 [2025-03-08 06:27:35,065 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-08 06:27:35,065 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.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:35,065 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.9s Time] [2025-03-08 06:27:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-08 06:27:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 918. [2025-03-08 06:27:35,075 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-08 06:27:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1227 transitions. [2025-03-08 06:27:35,076 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1227 transitions. Word has length 98 [2025-03-08 06:27:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:35,077 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1227 transitions. [2025-03-08 06:27:35,077 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-08 06:27:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1227 transitions. [2025-03-08 06:27:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:35,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:35,078 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-08 06:27:35,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:27:35,078 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-08 06:27:35,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1776875779, now seen corresponding path program 1 times [2025-03-08 06:27:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996069538] [2025-03-08 06:27:35,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:35,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:35,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:35,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:35,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:35,293 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-08 06:27:35,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:35,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996069538] [2025-03-08 06:27:35,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996069538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:35,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:35,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320473203] [2025-03-08 06:27:35,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:35,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:35,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:35,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:35,296 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-08 06:27:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:36,010 INFO L93 Difference]: Finished difference Result 1488 states and 1998 transitions. [2025-03-08 06:27:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:36,011 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-08 06:27:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:36,012 INFO L225 Difference]: With dead ends: 1488 [2025-03-08 06:27:36,012 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 06:27:36,012 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-08 06:27:36,013 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3588 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:36,013 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.6s Time] [2025-03-08 06:27:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 06:27:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 918. [2025-03-08 06:27:36,024 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-08 06:27:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1226 transitions. [2025-03-08 06:27:36,024 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1226 transitions. Word has length 98 [2025-03-08 06:27:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:36,025 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1226 transitions. [2025-03-08 06:27:36,025 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-08 06:27:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1226 transitions. [2025-03-08 06:27:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:36,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:36,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-08 06:27:36,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:27:36,026 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-08 06:27:36,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2140705763, now seen corresponding path program 1 times [2025-03-08 06:27:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:36,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91470694] [2025-03-08 06:27:36,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:36,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:36,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:36,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:36,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:36,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:36,170 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-08 06:27:36,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91470694] [2025-03-08 06:27:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91470694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:36,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706332891] [2025-03-08 06:27:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:36,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:36,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:36,171 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-08 06:27:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:36,847 INFO L93 Difference]: Finished difference Result 1491 states and 2000 transitions. [2025-03-08 06:27:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:36,847 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-08 06:27:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:36,849 INFO L225 Difference]: With dead ends: 1491 [2025-03-08 06:27:36,849 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 06:27:36,849 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-08 06:27:36,850 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2116 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:36,850 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.6s Time] [2025-03-08 06:27:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 06:27:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 918. [2025-03-08 06:27:36,858 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-08 06:27:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1225 transitions. [2025-03-08 06:27:36,859 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1225 transitions. Word has length 98 [2025-03-08 06:27:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:36,859 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1225 transitions. [2025-03-08 06:27:36,859 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-08 06:27:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1225 transitions. [2025-03-08 06:27:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:36,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:36,860 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-08 06:27:36,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:27:36,861 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-08 06:27:36,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1381299338, now seen corresponding path program 1 times [2025-03-08 06:27:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:36,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799917729] [2025-03-08 06:27:36,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:36,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:36,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:36,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:36,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:37,139 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-08 06:27:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799917729] [2025-03-08 06:27:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799917729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:37,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799867145] [2025-03-08 06:27:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:37,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:37,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:37,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:37,142 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-08 06:27:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:38,320 INFO L93 Difference]: Finished difference Result 2015 states and 2768 transitions. [2025-03-08 06:27:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:38,320 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-08 06:27:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:38,322 INFO L225 Difference]: With dead ends: 2015 [2025-03-08 06:27:38,322 INFO L226 Difference]: Without dead ends: 1850 [2025-03-08 06:27:38,322 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-08 06:27:38,323 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 5201 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-08 06:27:38,323 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-08 06:27:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-03-08 06:27:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 922. [2025-03-08 06:27:38,330 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-08 06:27:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1229 transitions. [2025-03-08 06:27:38,330 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1229 transitions. Word has length 98 [2025-03-08 06:27:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:38,330 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1229 transitions. [2025-03-08 06:27:38,331 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-08 06:27:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1229 transitions. [2025-03-08 06:27:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:38,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:38,331 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-08 06:27:38,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:27:38,332 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-08 06:27:38,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash 679651704, now seen corresponding path program 1 times [2025-03-08 06:27:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468763277] [2025-03-08 06:27:38,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:38,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:38,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:38,594 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-08 06:27:38,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:38,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468763277] [2025-03-08 06:27:38,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468763277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:38,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:38,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978759461] [2025-03-08 06:27:38,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:38,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:38,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:38,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:38,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:38,596 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-08 06:27:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:39,253 INFO L93 Difference]: Finished difference Result 1495 states and 2002 transitions. [2025-03-08 06:27:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:39,253 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-08 06:27:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:39,254 INFO L225 Difference]: With dead ends: 1495 [2025-03-08 06:27:39,254 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:39,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:27:39,255 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:39,255 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.6s Time] [2025-03-08 06:27:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-08 06:27:39,261 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-08 06:27:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1228 transitions. [2025-03-08 06:27:39,262 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1228 transitions. Word has length 98 [2025-03-08 06:27:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:39,262 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1228 transitions. [2025-03-08 06:27:39,262 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-08 06:27:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1228 transitions. [2025-03-08 06:27:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:39,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:39,263 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-08 06:27:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:27:39,263 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-08 06:27:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1593163795, now seen corresponding path program 1 times [2025-03-08 06:27:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349596422] [2025-03-08 06:27:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:39,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:39,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:39,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:39,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:39,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-08 06:27:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349596422] [2025-03-08 06:27:39,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349596422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:39,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:39,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844897941] [2025-03-08 06:27:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:39,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:39,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:39,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:39,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:39,435 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-08 06:27:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:40,130 INFO L93 Difference]: Finished difference Result 1492 states and 1998 transitions. [2025-03-08 06:27:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:40,131 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-08 06:27:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:40,132 INFO L225 Difference]: With dead ends: 1492 [2025-03-08 06:27:40,132 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:40,133 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-08 06:27:40,133 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-08 06:27:40,133 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-08 06:27:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-08 06:27:40,139 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-08 06:27:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1227 transitions. [2025-03-08 06:27:40,140 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1227 transitions. Word has length 98 [2025-03-08 06:27:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:40,140 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1227 transitions. [2025-03-08 06:27:40,140 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-08 06:27:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1227 transitions. [2025-03-08 06:27:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:40,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:40,141 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-08 06:27:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:27:40,141 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-08 06:27:40,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1128192332, now seen corresponding path program 1 times [2025-03-08 06:27:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976937760] [2025-03-08 06:27:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:40,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:40,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:40,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:40,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:40,390 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-08 06:27:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976937760] [2025-03-08 06:27:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976937760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514060663] [2025-03-08 06:27:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:40,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:40,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:40,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:40,392 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-08 06:27:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:41,033 INFO L93 Difference]: Finished difference Result 1492 states and 1997 transitions. [2025-03-08 06:27:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:41,033 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-08 06:27:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:41,035 INFO L225 Difference]: With dead ends: 1492 [2025-03-08 06:27:41,035 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:41,035 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-08 06:27:41,035 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-08 06:27:41,036 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-08 06:27:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-08 06:27:41,041 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-08 06:27:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1226 transitions. [2025-03-08 06:27:41,042 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1226 transitions. Word has length 98 [2025-03-08 06:27:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:41,042 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1226 transitions. [2025-03-08 06:27:41,042 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-08 06:27:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1226 transitions. [2025-03-08 06:27:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:41,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:41,043 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-08 06:27:41,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 06:27:41,043 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-08 06:27:41,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1172061482, now seen corresponding path program 1 times [2025-03-08 06:27:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039520421] [2025-03-08 06:27:41,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:41,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:41,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:41,193 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-08 06:27:41,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:41,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039520421] [2025-03-08 06:27:41,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039520421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:41,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:41,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:41,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658289967] [2025-03-08 06:27:41,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:41,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:41,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:41,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:41,195 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-08 06:27:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:41,885 INFO L93 Difference]: Finished difference Result 1490 states and 1993 transitions. [2025-03-08 06:27:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:41,885 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-08 06:27:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:41,887 INFO L225 Difference]: With dead ends: 1490 [2025-03-08 06:27:41,887 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:41,887 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-08 06:27:41,887 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-08 06:27:41,887 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-08 06:27:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 922. [2025-03-08 06:27:41,893 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-08 06:27:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1225 transitions. [2025-03-08 06:27:41,893 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1225 transitions. Word has length 98 [2025-03-08 06:27:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:41,893 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1225 transitions. [2025-03-08 06:27:41,893 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-08 06:27:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1225 transitions. [2025-03-08 06:27:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:41,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:41,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, 1, 1] [2025-03-08 06:27:41,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 06:27:41,894 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-08 06:27:41,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1867618250, now seen corresponding path program 1 times [2025-03-08 06:27:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003499401] [2025-03-08 06:27:41,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:41,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:41,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:41,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:41,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:42,169 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-08 06:27:42,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:42,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003499401] [2025-03-08 06:27:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003499401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:42,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:42,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:42,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81288252] [2025-03-08 06:27:42,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:42,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:42,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:42,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:42,171 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-08 06:27:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:43,235 INFO L93 Difference]: Finished difference Result 1864 states and 2534 transitions. [2025-03-08 06:27:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:43,236 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-08 06:27:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:43,237 INFO L225 Difference]: With dead ends: 1864 [2025-03-08 06:27:43,237 INFO L226 Difference]: Without dead ends: 1714 [2025-03-08 06:27:43,238 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-08 06:27:43,238 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-08 06:27:43,239 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-08 06:27:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-08 06:27:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 926. [2025-03-08 06:27:43,246 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-08 06:27:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1229 transitions. [2025-03-08 06:27:43,247 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1229 transitions. Word has length 98 [2025-03-08 06:27:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:43,247 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1229 transitions. [2025-03-08 06:27:43,247 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-08 06:27:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1229 transitions. [2025-03-08 06:27:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:43,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:43,248 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-08 06:27:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 06:27:43,248 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-08 06:27:43,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash -11372695, now seen corresponding path program 1 times [2025-03-08 06:27:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133810785] [2025-03-08 06:27:43,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:43,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:43,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:43,422 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-08 06:27:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133810785] [2025-03-08 06:27:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133810785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:43,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90197984] [2025-03-08 06:27:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:43,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:43,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:43,423 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-08 06:27:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:44,134 INFO L93 Difference]: Finished difference Result 1490 states and 1991 transitions. [2025-03-08 06:27:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:44,134 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-08 06:27:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:44,135 INFO L225 Difference]: With dead ends: 1490 [2025-03-08 06:27:44,135 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:44,136 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-08 06:27:44,136 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 4202 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:44,137 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.6s Time] [2025-03-08 06:27:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 926. [2025-03-08 06:27:44,142 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-08 06:27:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1228 transitions. [2025-03-08 06:27:44,143 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1228 transitions. Word has length 98 [2025-03-08 06:27:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:44,143 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1228 transitions. [2025-03-08 06:27:44,143 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-08 06:27:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1228 transitions. [2025-03-08 06:27:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:44,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:44,144 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-08 06:27:44,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 06:27:44,144 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-08 06:27:44,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1845973552, now seen corresponding path program 1 times [2025-03-08 06:27:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:44,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197352333] [2025-03-08 06:27:44,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:44,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:44,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:44,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:44,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:44,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:44,311 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-08 06:27:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:44,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197352333] [2025-03-08 06:27:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197352333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:44,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:44,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924734678] [2025-03-08 06:27:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:44,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:44,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:44,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:44,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:44,313 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-08 06:27:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:44,991 INFO L93 Difference]: Finished difference Result 1423 states and 1886 transitions. [2025-03-08 06:27:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:44,992 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-08 06:27:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:44,993 INFO L225 Difference]: With dead ends: 1423 [2025-03-08 06:27:44,993 INFO L226 Difference]: Without dead ends: 1406 [2025-03-08 06:27:44,994 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-08 06:27:44,994 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-08 06:27:44,994 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-08 06:27:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-03-08 06:27:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 926. [2025-03-08 06:27:45,001 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-08 06:27:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1226 transitions. [2025-03-08 06:27:45,002 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1226 transitions. Word has length 98 [2025-03-08 06:27:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:45,002 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1226 transitions. [2025-03-08 06:27:45,002 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-08 06:27:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1226 transitions. [2025-03-08 06:27:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:45,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:45,004 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-08 06:27:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 06:27:45,004 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-08 06:27:45,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash -388042702, now seen corresponding path program 1 times [2025-03-08 06:27:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586783354] [2025-03-08 06:27:45,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:45,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:45,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:45,169 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-08 06:27:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586783354] [2025-03-08 06:27:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586783354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850786053] [2025-03-08 06:27:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:45,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:45,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:45,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:45,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:45,170 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-08 06:27:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:45,890 INFO L93 Difference]: Finished difference Result 1347 states and 1772 transitions. [2025-03-08 06:27:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:45,891 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-08 06:27:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:45,892 INFO L225 Difference]: With dead ends: 1347 [2025-03-08 06:27:45,892 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:45,893 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-08 06:27:45,893 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 4136 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:45,893 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.6s Time] [2025-03-08 06:27:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 926. [2025-03-08 06:27:45,901 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-08 06:27:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1224 transitions. [2025-03-08 06:27:45,901 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1224 transitions. Word has length 98 [2025-03-08 06:27:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:45,901 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1224 transitions. [2025-03-08 06:27:45,902 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-08 06:27:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1224 transitions. [2025-03-08 06:27:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:45,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:45,903 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-08 06:27:45,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 06:27:45,903 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-08 06:27:45,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1073011357, now seen corresponding path program 1 times [2025-03-08 06:27:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220424131] [2025-03-08 06:27:45,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:45,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:45,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:45,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:46,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-08 06:27:46,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:46,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220424131] [2025-03-08 06:27:46,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220424131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:46,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:46,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674142873] [2025-03-08 06:27:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:46,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:46,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:46,154 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-08 06:27:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:47,166 INFO L93 Difference]: Finished difference Result 1719 states and 2310 transitions. [2025-03-08 06:27:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:47,167 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-08 06:27:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:47,168 INFO L225 Difference]: With dead ends: 1719 [2025-03-08 06:27:47,168 INFO L226 Difference]: Without dead ends: 1714 [2025-03-08 06:27:47,169 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-08 06:27:47,170 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 7450 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:47,170 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.8s Time] [2025-03-08 06:27:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-08 06:27:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 934. [2025-03-08 06:27:47,178 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-08 06:27:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1232 transitions. [2025-03-08 06:27:47,179 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1232 transitions. Word has length 98 [2025-03-08 06:27:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:47,179 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1232 transitions. [2025-03-08 06:27:47,179 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-08 06:27:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1232 transitions. [2025-03-08 06:27:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:47,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:47,181 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-08 06:27:47,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 06:27:47,181 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-08 06:27:47,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1450722815, now seen corresponding path program 1 times [2025-03-08 06:27:47,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:47,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739980433] [2025-03-08 06:27:47,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:47,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:47,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:47,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:47,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:47,367 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-08 06:27:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:47,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739980433] [2025-03-08 06:27:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739980433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:47,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:47,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372757251] [2025-03-08 06:27:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:47,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:47,368 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-08 06:27:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:47,983 INFO L93 Difference]: Finished difference Result 1494 states and 1988 transitions. [2025-03-08 06:27:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:47,984 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-08 06:27:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:47,985 INFO L225 Difference]: With dead ends: 1494 [2025-03-08 06:27:47,985 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:47,986 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-08 06:27:47,986 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-08 06:27:47,986 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-08 06:27:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-08 06:27:47,991 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-08 06:27:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1230 transitions. [2025-03-08 06:27:47,992 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1230 transitions. Word has length 98 [2025-03-08 06:27:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:47,992 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1230 transitions. [2025-03-08 06:27:47,992 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-08 06:27:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1230 transitions. [2025-03-08 06:27:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:47,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:47,993 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-08 06:27:47,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 06:27:47,993 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-08 06:27:47,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash -834879777, now seen corresponding path program 1 times [2025-03-08 06:27:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996621465] [2025-03-08 06:27:47,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:48,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:48,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:48,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:48,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:48,144 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-08 06:27:48,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:48,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996621465] [2025-03-08 06:27:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996621465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:48,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:48,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888610506] [2025-03-08 06:27:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:48,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:48,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:48,145 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-08 06:27:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:48,770 INFO L93 Difference]: Finished difference Result 1347 states and 1766 transitions. [2025-03-08 06:27:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:48,770 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-08 06:27:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:48,771 INFO L225 Difference]: With dead ends: 1347 [2025-03-08 06:27:48,771 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:48,771 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-08 06:27:48,771 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-08 06:27:48,772 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-08 06:27:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-08 06:27:48,777 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-08 06:27:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1228 transitions. [2025-03-08 06:27:48,778 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1228 transitions. Word has length 98 [2025-03-08 06:27:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:48,778 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1228 transitions. [2025-03-08 06:27:48,778 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-08 06:27:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1228 transitions. [2025-03-08 06:27:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:48,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:48,779 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-08 06:27:48,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 06:27:48,779 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-08 06:27:48,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash -457247759, now seen corresponding path program 1 times [2025-03-08 06:27:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:48,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547033183] [2025-03-08 06:27:48,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:48,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:48,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:48,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:48,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:48,913 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-08 06:27:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547033183] [2025-03-08 06:27:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547033183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:48,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997152810] [2025-03-08 06:27:48,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:48,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:48,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:48,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:48,914 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-08 06:27:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:49,545 INFO L93 Difference]: Finished difference Result 1494 states and 1982 transitions. [2025-03-08 06:27:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:49,545 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-08 06:27:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:49,546 INFO L225 Difference]: With dead ends: 1494 [2025-03-08 06:27:49,547 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:49,547 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-08 06:27:49,547 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-08 06:27:49,547 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-08 06:27:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-08 06:27:49,553 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-08 06:27:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1226 transitions. [2025-03-08 06:27:49,553 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1226 transitions. Word has length 98 [2025-03-08 06:27:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:49,554 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1226 transitions. [2025-03-08 06:27:49,554 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-08 06:27:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1226 transitions. [2025-03-08 06:27:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:49,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:49,555 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-08 06:27:49,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 06:27:49,555 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-08 06:27:49,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash 855708336, now seen corresponding path program 1 times [2025-03-08 06:27:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:49,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765625912] [2025-03-08 06:27:49,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:49,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:49,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:49,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:49,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:49,711 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-08 06:27:49,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765625912] [2025-03-08 06:27:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765625912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:49,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996422675] [2025-03-08 06:27:49,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:49,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:49,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:49,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:49,712 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-08 06:27:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:50,442 INFO L93 Difference]: Finished difference Result 1578 states and 2098 transitions. [2025-03-08 06:27:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:50,442 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-08 06:27:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:50,444 INFO L225 Difference]: With dead ends: 1578 [2025-03-08 06:27:50,444 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 06:27:50,444 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-08 06:27:50,444 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-08 06:27:50,444 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-08 06:27:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 06:27:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 934. [2025-03-08 06:27:50,450 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-08 06:27:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1224 transitions. [2025-03-08 06:27:50,451 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1224 transitions. Word has length 98 [2025-03-08 06:27:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:50,451 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1224 transitions. [2025-03-08 06:27:50,451 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-08 06:27:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1224 transitions. [2025-03-08 06:27:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:50,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:50,452 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-08 06:27:50,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 06:27:50,452 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-08 06:27:50,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash -879386667, now seen corresponding path program 1 times [2025-03-08 06:27:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188859127] [2025-03-08 06:27:50,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:50,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:50,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:50,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:50,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:50,604 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-08 06:27:50,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:50,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188859127] [2025-03-08 06:27:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188859127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:50,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367170231] [2025-03-08 06:27:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:50,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:50,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:50,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:50,605 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-08 06:27:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:51,235 INFO L93 Difference]: Finished difference Result 1490 states and 1974 transitions. [2025-03-08 06:27:51,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:51,236 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-08 06:27:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:51,237 INFO L225 Difference]: With dead ends: 1490 [2025-03-08 06:27:51,237 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:51,238 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-08 06:27:51,238 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 2865 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:51,238 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.6s Time] [2025-03-08 06:27:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-08 06:27:51,243 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-08 06:27:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1222 transitions. [2025-03-08 06:27:51,244 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1222 transitions. Word has length 98 [2025-03-08 06:27:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:51,244 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1222 transitions. [2025-03-08 06:27:51,244 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-08 06:27:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1222 transitions. [2025-03-08 06:27:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:51,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:51,245 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-08 06:27:51,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 06:27:51,246 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-08 06:27:51,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:51,246 INFO L85 PathProgramCache]: Analyzing trace with hash -399578380, now seen corresponding path program 1 times [2025-03-08 06:27:51,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:51,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000875929] [2025-03-08 06:27:51,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:51,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:51,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:51,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:51,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:51,402 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-08 06:27:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000875929] [2025-03-08 06:27:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000875929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924374394] [2025-03-08 06:27:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:51,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:51,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:51,403 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-08 06:27:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:52,093 INFO L93 Difference]: Finished difference Result 1494 states and 1976 transitions. [2025-03-08 06:27:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:52,093 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-08 06:27:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:52,095 INFO L225 Difference]: With dead ends: 1494 [2025-03-08 06:27:52,095 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:52,095 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-08 06:27:52,095 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-08 06:27:52,095 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-08 06:27:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-08 06:27:52,101 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-08 06:27:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1220 transitions. [2025-03-08 06:27:52,102 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1220 transitions. Word has length 98 [2025-03-08 06:27:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:52,102 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1220 transitions. [2025-03-08 06:27:52,102 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-08 06:27:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1220 transitions. [2025-03-08 06:27:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:52,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:52,103 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-08 06:27:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 06:27:52,103 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-08 06:27:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash -777471557, now seen corresponding path program 1 times [2025-03-08 06:27:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070780077] [2025-03-08 06:27:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:52,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:52,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:52,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:52,352 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-08 06:27:52,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:52,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070780077] [2025-03-08 06:27:52,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070780077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:52,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869950822] [2025-03-08 06:27:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:52,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:52,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:52,353 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-08 06:27:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:53,395 INFO L93 Difference]: Finished difference Result 1870 states and 2519 transitions. [2025-03-08 06:27:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:53,396 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-08 06:27:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:53,397 INFO L225 Difference]: With dead ends: 1870 [2025-03-08 06:27:53,397 INFO L226 Difference]: Without dead ends: 1714 [2025-03-08 06:27:53,398 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-08 06:27:53,398 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-08 06:27:53,398 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-08 06:27:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-08 06:27:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 942. [2025-03-08 06:27:53,404 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-08 06:27:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1228 transitions. [2025-03-08 06:27:53,405 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1228 transitions. Word has length 98 [2025-03-08 06:27:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:53,405 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1228 transitions. [2025-03-08 06:27:53,405 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-08 06:27:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1228 transitions. [2025-03-08 06:27:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:53,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:53,406 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-08 06:27:53,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 06:27:53,406 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-08 06:27:53,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:53,406 INFO L85 PathProgramCache]: Analyzing trace with hash -4509362, now seen corresponding path program 1 times [2025-03-08 06:27:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283319935] [2025-03-08 06:27:53,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:53,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:53,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:53,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:53,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:53,545 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-08 06:27:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:53,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283319935] [2025-03-08 06:27:53,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283319935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:53,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:53,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:53,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446440066] [2025-03-08 06:27:53,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:53,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:53,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:53,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:53,546 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-08 06:27:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:54,252 INFO L93 Difference]: Finished difference Result 1594 states and 2110 transitions. [2025-03-08 06:27:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:54,252 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-08 06:27:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:54,253 INFO L225 Difference]: With dead ends: 1594 [2025-03-08 06:27:54,253 INFO L226 Difference]: Without dead ends: 1422 [2025-03-08 06:27:54,254 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-08 06:27:54,254 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-08 06:27:54,254 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-08 06:27:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-03-08 06:27:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 942. [2025-03-08 06:27:54,259 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-08 06:27:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1226 transitions. [2025-03-08 06:27:54,260 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1226 transitions. Word has length 98 [2025-03-08 06:27:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:54,260 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1226 transitions. [2025-03-08 06:27:54,260 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-08 06:27:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1226 transitions. [2025-03-08 06:27:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:54,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:54,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-08 06:27:54,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-08 06:27:54,261 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-08 06:27:54,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:54,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2056441680, now seen corresponding path program 1 times [2025-03-08 06:27:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030030636] [2025-03-08 06:27:54,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:54,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:54,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:54,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:54,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:54,407 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-08 06:27:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030030636] [2025-03-08 06:27:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030030636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047614508] [2025-03-08 06:27:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:54,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:54,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:54,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:54,408 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-08 06:27:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:55,042 INFO L93 Difference]: Finished difference Result 1498 states and 1975 transitions. [2025-03-08 06:27:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:55,042 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-08 06:27:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:55,043 INFO L225 Difference]: With dead ends: 1498 [2025-03-08 06:27:55,043 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:55,043 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-08 06:27:55,044 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-08 06:27:55,044 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-08 06:27:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 942. [2025-03-08 06:27:55,049 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-08 06:27:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1224 transitions. [2025-03-08 06:27:55,050 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1224 transitions. Word has length 98 [2025-03-08 06:27:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:55,050 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1224 transitions. [2025-03-08 06:27:55,050 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-08 06:27:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1224 transitions. [2025-03-08 06:27:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:55,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:55,051 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-08 06:27:55,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-08 06:27:55,051 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-08 06:27:55,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1858235353, now seen corresponding path program 1 times [2025-03-08 06:27:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:55,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314380000] [2025-03-08 06:27:55,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:55,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:55,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:55,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:55,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:55,180 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-08 06:27:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314380000] [2025-03-08 06:27:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314380000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560767095] [2025-03-08 06:27:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:55,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:55,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:55,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:55,181 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-08 06:27:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:55,895 INFO L93 Difference]: Finished difference Result 1666 states and 2204 transitions. [2025-03-08 06:27:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:55,895 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-08 06:27:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:55,896 INFO L225 Difference]: With dead ends: 1666 [2025-03-08 06:27:55,896 INFO L226 Difference]: Without dead ends: 1454 [2025-03-08 06:27:55,897 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-08 06:27:55,897 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-08 06:27:55,897 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-08 06:27:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-08 06:27:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 942. [2025-03-08 06:27:55,902 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-08 06:27:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1222 transitions. [2025-03-08 06:27:55,903 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1222 transitions. Word has length 98 [2025-03-08 06:27:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:55,903 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1222 transitions. [2025-03-08 06:27:55,903 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-08 06:27:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1222 transitions. [2025-03-08 06:27:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:55,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:55,904 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-08 06:27:55,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-08 06:27:55,904 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-08 06:27:55,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1228052951, now seen corresponding path program 1 times [2025-03-08 06:27:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:55,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773371651] [2025-03-08 06:27:55,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:55,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:55,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:55,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:55,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:55,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:56,081 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-08 06:27:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:56,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773371651] [2025-03-08 06:27:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773371651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197133816] [2025-03-08 06:27:56,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:56,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:56,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:56,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:56,082 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-08 06:27:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:56,814 INFO L93 Difference]: Finished difference Result 1594 states and 2100 transitions. [2025-03-08 06:27:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:56,815 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-08 06:27:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:56,816 INFO L225 Difference]: With dead ends: 1594 [2025-03-08 06:27:56,816 INFO L226 Difference]: Without dead ends: 1422 [2025-03-08 06:27:56,817 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-08 06:27:56,817 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-08 06:27:56,817 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-08 06:27:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-03-08 06:27:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 942. [2025-03-08 06:27:56,824 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-08 06:27:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1220 transitions. [2025-03-08 06:27:56,824 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1220 transitions. Word has length 98 [2025-03-08 06:27:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:56,824 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1220 transitions. [2025-03-08 06:27:56,825 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-08 06:27:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1220 transitions. [2025-03-08 06:27:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:27:56,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:56,826 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-08 06:27:56,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-08 06:27:56,827 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-08 06:27:56,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash 832898091, now seen corresponding path program 1 times [2025-03-08 06:27:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:56,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641291341] [2025-03-08 06:27:56,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:56,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:56,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:27:56,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:27:56,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:56,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:56,987 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-08 06:27:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641291341] [2025-03-08 06:27:56,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641291341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:56,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818974255] [2025-03-08 06:27:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:56,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:56,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:56,988 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-08 06:27:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:57,624 INFO L93 Difference]: Finished difference Result 1498 states and 1969 transitions. [2025-03-08 06:27:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:57,624 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-08 06:27:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:57,625 INFO L225 Difference]: With dead ends: 1498 [2025-03-08 06:27:57,625 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:57,626 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-08 06:27:57,626 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 3541 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:57,626 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.6s Time] [2025-03-08 06:27:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 942. [2025-03-08 06:27:57,633 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-08 06:27:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1218 transitions. [2025-03-08 06:27:57,633 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1218 transitions. Word has length 98 [2025-03-08 06:27:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:57,633 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1218 transitions. [2025-03-08 06:27:57,633 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-08 06:27:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1218 transitions. [2025-03-08 06:27:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:27:57,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:57,634 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-08 06:27:57,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-08 06:27:57,635 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-08 06:27:57,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash 247407176, now seen corresponding path program 1 times [2025-03-08 06:27:57,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:57,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319429517] [2025-03-08 06:27:57,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:57,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:27:57,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:27:57,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:57,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:57,777 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-08 06:27:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319429517] [2025-03-08 06:27:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319429517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:57,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:57,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:57,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402863611] [2025-03-08 06:27:57,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:57,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:57,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:57,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:57,778 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-08 06:27:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:58,428 INFO L93 Difference]: Finished difference Result 1495 states and 1963 transitions. [2025-03-08 06:27:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:58,428 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-08 06:27:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:58,430 INFO L225 Difference]: With dead ends: 1495 [2025-03-08 06:27:58,430 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:58,430 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-08 06:27:58,430 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 2967 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:58,430 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.6s Time] [2025-03-08 06:27:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 938. [2025-03-08 06:27:58,435 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-08 06:27:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1213 transitions. [2025-03-08 06:27:58,436 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1213 transitions. Word has length 99 [2025-03-08 06:27:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:58,436 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1213 transitions. [2025-03-08 06:27:58,436 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-08 06:27:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1213 transitions. [2025-03-08 06:27:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:27:58,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:58,437 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-08 06:27:58,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-08 06:27:58,437 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-08 06:27:58,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1918001654, now seen corresponding path program 1 times [2025-03-08 06:27:58,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:58,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64376020] [2025-03-08 06:27:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:58,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:27:58,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:27:58,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:58,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:58,577 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-08 06:27:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64376020] [2025-03-08 06:27:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64376020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200496634] [2025-03-08 06:27:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:58,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:58,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:58,578 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-08 06:27:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:59,214 INFO L93 Difference]: Finished difference Result 1492 states and 1959 transitions. [2025-03-08 06:27:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:59,214 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-08 06:27:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:59,215 INFO L225 Difference]: With dead ends: 1492 [2025-03-08 06:27:59,215 INFO L226 Difference]: Without dead ends: 1342 [2025-03-08 06:27:59,216 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-08 06:27:59,216 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-08 06:27:59,216 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-08 06:27:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-03-08 06:27:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 934. [2025-03-08 06:27:59,222 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-08 06:27:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1208 transitions. [2025-03-08 06:27:59,223 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1208 transitions. Word has length 99 [2025-03-08 06:27:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:59,223 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1208 transitions. [2025-03-08 06:27:59,223 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-08 06:27:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1208 transitions. [2025-03-08 06:27:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:27:59,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:59,224 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-08 06:27:59,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-08 06:27:59,225 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-08 06:27:59,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1184737288, now seen corresponding path program 1 times [2025-03-08 06:27:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882103726] [2025-03-08 06:27:59,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:59,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:59,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:27:59,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:27:59,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:59,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:59,367 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-08 06:27:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882103726] [2025-03-08 06:27:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882103726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:59,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:59,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732177055] [2025-03-08 06:27:59,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:59,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:59,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:59,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:59,369 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-08 06:28:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:00,121 INFO L93 Difference]: Finished difference Result 1575 states and 2070 transitions. [2025-03-08 06:28:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:00,122 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-08 06:28:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:00,123 INFO L225 Difference]: With dead ends: 1575 [2025-03-08 06:28:00,123 INFO L226 Difference]: Without dead ends: 1410 [2025-03-08 06:28:00,123 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-08 06:28:00,123 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:00,123 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.7s Time] [2025-03-08 06:28:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-03-08 06:28:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 930. [2025-03-08 06:28:00,129 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-08 06:28:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1203 transitions. [2025-03-08 06:28:00,129 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1203 transitions. Word has length 99 [2025-03-08 06:28:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1203 transitions. [2025-03-08 06:28:00,130 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-08 06:28:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1203 transitions. [2025-03-08 06:28:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:28:00,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:00,131 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-08 06:28:00,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-08 06:28:00,131 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-08 06:28:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash -505692696, now seen corresponding path program 1 times [2025-03-08 06:28:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:00,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192081836] [2025-03-08 06:28:00,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:00,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:28:00,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:28:00,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:00,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:00,265 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-08 06:28:00,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192081836] [2025-03-08 06:28:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192081836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:00,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:00,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201965349] [2025-03-08 06:28:00,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:00,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:00,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:00,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:00,266 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-08 06:28:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:00,899 INFO L93 Difference]: Finished difference Result 1488 states and 1953 transitions. [2025-03-08 06:28:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:00,899 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-08 06:28:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:00,900 INFO L225 Difference]: With dead ends: 1488 [2025-03-08 06:28:00,900 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 06:28:00,901 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-08 06:28:00,901 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-08 06:28:00,901 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-08 06:28:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 06:28:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 926. [2025-03-08 06:28:00,907 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-08 06:28:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1198 transitions. [2025-03-08 06:28:00,907 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1198 transitions. Word has length 99 [2025-03-08 06:28:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:00,907 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1198 transitions. [2025-03-08 06:28:00,907 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-08 06:28:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1198 transitions. [2025-03-08 06:28:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:28:00,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:00,908 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-08 06:28:00,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-08 06:28:00,909 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-08 06:28:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 991650033, now seen corresponding path program 1 times [2025-03-08 06:28:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118856220] [2025-03-08 06:28:00,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:00,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:28:00,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:28:00,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:00,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:01,055 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-08 06:28:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118856220] [2025-03-08 06:28:01,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118856220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:01,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:01,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:01,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354915480] [2025-03-08 06:28:01,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:01,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:01,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:01,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:01,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:01,056 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-08 06:28:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:01,646 INFO L93 Difference]: Finished difference Result 1487 states and 1951 transitions. [2025-03-08 06:28:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:28:01,647 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-08 06:28:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:01,648 INFO L225 Difference]: With dead ends: 1487 [2025-03-08 06:28:01,648 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 06:28:01,648 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-08 06:28:01,648 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-08 06:28:01,649 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-08 06:28:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 06:28:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 926. [2025-03-08 06:28:01,654 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-08 06:28:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1197 transitions. [2025-03-08 06:28:01,654 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1197 transitions. Word has length 99 [2025-03-08 06:28:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:01,654 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1197 transitions. [2025-03-08 06:28:01,654 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-08 06:28:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1197 transitions. [2025-03-08 06:28:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:28:01,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:01,655 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-08 06:28:01,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-08 06:28:01,655 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-08 06:28:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 523701560, now seen corresponding path program 1 times [2025-03-08 06:28:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092340266] [2025-03-08 06:28:01,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:01,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:28:01,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:28:01,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:01,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:01,799 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-08 06:28:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092340266] [2025-03-08 06:28:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092340266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:01,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364270280] [2025-03-08 06:28:01,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:01,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:01,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:01,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:01,800 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-08 06:28:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:02,429 INFO L93 Difference]: Finished difference Result 1343 states and 1733 transitions. [2025-03-08 06:28:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:02,430 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-08 06:28:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:02,431 INFO L225 Difference]: With dead ends: 1343 [2025-03-08 06:28:02,431 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 06:28:02,431 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-08 06:28:02,431 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-08 06:28:02,432 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-08 06:28:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 06:28:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 918. [2025-03-08 06:28:02,437 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-08 06:28:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1187 transitions. [2025-03-08 06:28:02,437 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1187 transitions. Word has length 99 [2025-03-08 06:28:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:02,437 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1187 transitions. [2025-03-08 06:28:02,437 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-08 06:28:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1187 transitions. [2025-03-08 06:28:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:28:02,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:02,438 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-08 06:28:02,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-08 06:28:02,438 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-08 06:28:02,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1006694109, now seen corresponding path program 1 times [2025-03-08 06:28:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:02,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217301040] [2025-03-08 06:28:02,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:02,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:28:02,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:28:02,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:02,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:02,595 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-08 06:28:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217301040] [2025-03-08 06:28:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217301040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:02,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:28:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351053399] [2025-03-08 06:28:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:02,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:28:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:02,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:28:02,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:28:02,596 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-08 06:28:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:03,261 INFO L93 Difference]: Finished difference Result 1494 states and 1956 transitions. [2025-03-08 06:28:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:03,262 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-08 06:28:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:03,263 INFO L225 Difference]: With dead ends: 1494 [2025-03-08 06:28:03,263 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 06:28:03,263 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-08 06:28:03,263 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 3826 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:28:03,264 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.6s Time] [2025-03-08 06:28:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 06:28:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 910. [2025-03-08 06:28:03,269 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-08 06:28:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1177 transitions. [2025-03-08 06:28:03,269 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1177 transitions. Word has length 99 [2025-03-08 06:28:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:03,269 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1177 transitions. [2025-03-08 06:28:03,270 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-08 06:28:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1177 transitions. [2025-03-08 06:28:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:28:03,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:03,270 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-08 06:28:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-08 06:28:03,271 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-08 06:28:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1761222833, now seen corresponding path program 1 times [2025-03-08 06:28:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521991553] [2025-03-08 06:28:03,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:03,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:28:03,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:28:03,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:03,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:28:03,612 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-08 06:28:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:28:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521991553] [2025-03-08 06:28:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521991553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:28:03,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:28:03,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:28:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226344065] [2025-03-08 06:28:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:28:03,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:28:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:28:03,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:28:03,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:28:03,613 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-08 06:28:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:28:03,981 INFO L93 Difference]: Finished difference Result 1328 states and 1735 transitions. [2025-03-08 06:28:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:28:03,981 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-08 06:28:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:28:03,982 INFO L225 Difference]: With dead ends: 1328 [2025-03-08 06:28:03,982 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 06:28:03,982 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-08 06:28:03,983 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-08 06:28:03,983 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-08 06:28:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 06:28:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 689. [2025-03-08 06:28:03,987 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-08 06:28:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 892 transitions. [2025-03-08 06:28:03,987 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 892 transitions. Word has length 100 [2025-03-08 06:28:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:28:03,987 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 892 transitions. [2025-03-08 06:28:03,987 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-08 06:28:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 892 transitions. [2025-03-08 06:28:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:28:03,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:28:03,988 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-08 06:28:03,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-08 06:28:03,988 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-08 06:28:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:28:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1437056528, now seen corresponding path program 1 times [2025-03-08 06:28:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:28:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074593678] [2025-03-08 06:28:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:28:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:28:04,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:28:04,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:28:04,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:28:04,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat