./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:44:59,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:44:59,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:44:59,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:44:59,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:44:59,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:44:59,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:44:59,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:44:59,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:44:59,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:44:59,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:44:59,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:44:59,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:44:59,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:44:59,677 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:44:59,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:44:59,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:44:59,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:44:59,678 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:44:59,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:44:59,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:44:59,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:44:59,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:44:59,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:44:59,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:44:59,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:44:59,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:44:59,680 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7c220fedd5daa4b7bd4bc3bda2bd43ccc828cdccab93a1f1d73e2bd64ffc19c [2025-02-05 16:44:59,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:44:59,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:44:59,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:44:59,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:44:59,978 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:44:59,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:45:01,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e19160f8/c2306f96c6b2452a8db14be0eea48517/FLAG9fe2f4ac2 [2025-02-05 16:45:01,646 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:45:01,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:45:01,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e19160f8/c2306f96c6b2452a8db14be0eea48517/FLAG9fe2f4ac2 [2025-02-05 16:45:01,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e19160f8/c2306f96c6b2452a8db14be0eea48517 [2025-02-05 16:45:01,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:45:01,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:45:01,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:01,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:45:01,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:45:01,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:01" (1/1) ... [2025-02-05 16:45:01,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2992ca7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:01, skipping insertion in model container [2025-02-05 16:45:01,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:01" (1/1) ... [2025-02-05 16:45:01,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:45:02,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2025-02-05 16:45:02,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2025-02-05 16:45:02,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2025-02-05 16:45:02,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2025-02-05 16:45:02,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2025-02-05 16:45:02,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2025-02-05 16:45:02,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2025-02-05 16:45:02,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2025-02-05 16:45:02,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2025-02-05 16:45:02,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2025-02-05 16:45:02,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2025-02-05 16:45:02,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2025-02-05 16:45:02,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2025-02-05 16:45:02,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2025-02-05 16:45:02,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2025-02-05 16:45:02,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2025-02-05 16:45:02,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2025-02-05 16:45:02,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2025-02-05 16:45:02,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2025-02-05 16:45:02,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2025-02-05 16:45:02,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2025-02-05 16:45:02,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2025-02-05 16:45:02,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:02,962 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:45:03,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69402,69415] [2025-02-05 16:45:03,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[100988,101001] [2025-02-05 16:45:03,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[116766,116779] [2025-02-05 16:45:03,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124651,124664] [2025-02-05 16:45:03,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128577,128590] [2025-02-05 16:45:03,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132299,132312] [2025-02-05 16:45:03,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163377,163390] [2025-02-05 16:45:03,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[178940,178953] [2025-02-05 16:45:03,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[186820,186833] [2025-02-05 16:45:03,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[190741,190754] [2025-02-05 16:45:03,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194458,194471] [2025-02-05 16:45:03,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211203,211216] [2025-02-05 16:45:03,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219083,219096] [2025-02-05 16:45:03,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223004,223017] [2025-02-05 16:45:03,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226721,226734] [2025-02-05 16:45:03,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231221,231234] [2025-02-05 16:45:03,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[234989,235002] [2025-02-05 16:45:03,293 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[238910,238923] [2025-02-05 16:45:03,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[242627,242640] [2025-02-05 16:45:03,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[246748,246761] [2025-02-05 16:45:03,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[250481,250494] [2025-02-05 16:45:03,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[254398,254411] [2025-02-05 16:45:03,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:03,364 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:45:03,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03 WrapperNode [2025-02-05 16:45:03,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:03,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:03,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:45:03,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:45:03,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,592 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12202 [2025-02-05 16:45:03,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:03,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:45:03,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:45:03,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:45:03,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,690 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-02-05 16:45:03,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:45:03,916 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:45:03,917 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:45:03,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:45:03,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (1/1) ... [2025-02-05 16:45:03,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:45:03,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:45:03,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:45:03,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:45:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:45:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:45:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:45:03,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:45:04,209 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:45:04,211 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:45:10,133 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8166: havoc main_~node6__m6~37#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~33#1; [2025-02-05 16:45:10,133 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18473: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~94#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~72#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~93#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7379: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~33#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13457: havoc main_~check__tmp~62#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~61#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20592: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17952: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~63#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19805: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~93#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9236: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~35#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10033: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4220: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~15#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3432: havoc main_~node6__m6~14#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17969: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~70#1; [2025-02-05 16:45:10,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20348: havoc main_~node3__m3~68#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6607: havoc main_~check__tmp~25#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5022: havoc main_~check__tmp~18#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~18#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~17#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~3#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9253: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~42#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1854: havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4237: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~18#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20621: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11902: havoc main_~node6__m6~55#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~53#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16133: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~75#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12963: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~45#1; [2025-02-05 16:45:10,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16927: havoc main_~check__tmp~84#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~83#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17986: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~84#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10324: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18781: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~96#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~95#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14819: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~69#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13770: havoc main_~check__tmp~64#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~63#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12980: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~50#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20380: havoc main_~node4__m4~72#1; [2025-02-05 16:45:10,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8492: havoc main_~check__tmp~35#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~34#1; [2025-02-05 16:45:10,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5321: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-05 16:45:10,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11137: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~51#1; [2025-02-05 16:45:10,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L567: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:45:10,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~9#1; [2025-02-05 16:45:10,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2155: havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6913: havoc main_~node6__m6~31#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~26#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19072: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~98#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~60#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~97#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12997: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~60#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17226: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~86#1;havoc main_~node6__m6~80#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~85#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2963: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~10#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3756: havoc main_~node6__m6~16#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6135: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~27#1; [2025-02-05 16:45:10,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7986: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~27#1; [2025-02-05 16:45:10,139 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15650: havoc main_~check__tmp~76#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~75#1; [2025-02-05 16:45:10,139 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12216: havoc main_~check__tmp~55#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~54#1; [2025-02-05 16:45:10,139 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L326: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14069: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~66#1;havoc main_~node6__m6~65#1;havoc main_~node5__m5~54#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~65#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20412: havoc main_~node5__m5~80#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~12#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8003: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~30#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9854: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~45#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L343: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8805: havoc main_~check__tmp~37#1;havoc main_~node6__m6~40#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~36#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16737: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~65#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L884: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15419: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~51#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8020: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~36#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4849: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~21#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17534: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~88#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~87#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1686: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~5#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: havoc main_~node6__m6~10#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:45:10,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19392: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~100#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~68#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~99#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7239: havoc main_~check__tmp~28#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~27#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~27#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18602: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~87#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10676: havoc main_~node6__m6~49#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16754: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~78#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15436: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~54#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12529: havoc main_~check__tmp~57#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~56#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11739: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~45#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5661: havoc main_~node6__m6~25#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4077: havoc main_~check__tmp~13#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~6#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9104: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~38#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13597: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~63#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17825: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~90#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~89#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14391: havoc main_~check__tmp~68#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~45#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~67#1; [2025-02-05 16:45:10,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15453: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~60#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11756: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~54#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19684: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~102#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~101#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20480: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~96#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15993: havoc main_~check__tmp~78#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~77#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10976: havoc main_~node6__m6~50#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15470: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~72#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6750: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~25#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12828: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~59#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~58#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962: havoc main_~node6__m6~26#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10457: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~33#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7552: havoc main_~check__tmp~30#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~29#1; [2025-02-05 16:45:10,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: havoc main_~node6__m6~19#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14690: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~70#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~69#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~8#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~9#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215: havoc main_~node6__m6~4#1;havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20508: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6767: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~30#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19987: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~104#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~103#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10474: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~34#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19196: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~75#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3605: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~15#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5459: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~17#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8632: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~39#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9426: havoc main_~check__tmp~41#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~36#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~40#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17355: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~81#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10491: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~36#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16306: havoc main_~check__tmp~80#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~63#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~51#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~79#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19213: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~90#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7851: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~32#1;havoc main_~node6__m6~35#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~31#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20536: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11288: havoc main_~node6__m6~52#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~35#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5476: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~18#1; [2025-02-05 16:45:10,146 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20275: havoc main_~node1__m1~65#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~106#1;havoc main_~node6__m6~95#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~105#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1515: havoc main_~node6__m6~5#1;havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13143: havoc main_~node6__m6~61#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~60#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14201: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~55#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14998: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~72#1;havoc main_~node6__m6~70#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~71#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12356: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~57#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18171: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~92#1;havoc main_~node6__m6~85#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~91#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10508: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~40#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5493: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6286: havoc main_~node6__m6~28#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9725: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14218: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~66#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2328: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~9#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20564: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4709: havoc main_~check__tmp~16#1;havoc main_~node6__m6~20#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~15#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~15#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10525: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16605: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~82#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~81#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3131: havoc main_~node6__m6~13#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~9#1; [2025-02-05 16:45:10,147 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5510: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~24#1; [2025-02-05 16:45:10,148 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15289: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~74#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~73#1; [2025-02-05 16:45:10,148 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20316: havoc main_~node2__m2~66#1; [2025-02-05 16:45:10,148 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11596: havoc main_~check__tmp~52#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-02-05 16:45:10,803 INFO L? ?]: Removed 2222 outVars from TransFormulas that were not future-live. [2025-02-05 16:45:10,803 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:45:10,874 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:45:10,875 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:45:10,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:10 BoogieIcfgContainer [2025-02-05 16:45:10,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:45:10,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:45:10,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:45:10,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:45:10,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:45:01" (1/3) ... [2025-02-05 16:45:10,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7588b911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:10, skipping insertion in model container [2025-02-05 16:45:10,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:03" (2/3) ... [2025-02-05 16:45:10,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7588b911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:10, skipping insertion in model container [2025-02-05 16:45:10,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:10" (3/3) ... [2025-02-05 16:45:10,884 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:45:10,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:45:10,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 2348 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-02-05 16:45:10,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:45:10,986 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;@7052521e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:45:10,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-05 16:45:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2325 states have (on average 1.821505376344086) internal successors, (4235), 2347 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:45:11,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:11,015 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-02-05 16:45:11,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:11,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1381768955, now seen corresponding path program 1 times [2025-02-05 16:45:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227948928] [2025-02-05 16:45:11,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:11,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:45:11,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:45:11,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:11,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:11,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227948928] [2025-02-05 16:45:11,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227948928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:11,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:11,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660074592] [2025-02-05 16:45:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:11,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:11,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:11,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:11,538 INFO L87 Difference]: Start difference. First operand has 2348 states, 2325 states have (on average 1.821505376344086) internal successors, (4235), 2347 states have internal predecessors, (4235), 0 states have call successors, (0), 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-02-05 16:45:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:12,957 INFO L93 Difference]: Finished difference Result 2676 states and 4754 transitions. [2025-02-05 16:45:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:12,961 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-02-05 16:45:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:12,989 INFO L225 Difference]: With dead ends: 2676 [2025-02-05 16:45:12,989 INFO L226 Difference]: Without dead ends: 1505 [2025-02-05 16:45:12,997 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-02-05 16:45:12,999 INFO L435 NwaCegarLoop]: 1447 mSDtfsCounter, 7827 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7827 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:13,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7827 Valid, 1509 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:45:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-02-05 16:45:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-02-05 16:45:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1483 states have (on average 1.3149022252191505) internal successors, (1950), 1504 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1950 transitions. [2025-02-05 16:45:13,119 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1950 transitions. Word has length 86 [2025-02-05 16:45:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:13,120 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1950 transitions. [2025-02-05 16:45:13,120 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-02-05 16:45:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1950 transitions. [2025-02-05 16:45:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:45:13,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:13,124 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-02-05 16:45:13,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:45:13,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:13,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1923461938, now seen corresponding path program 1 times [2025-02-05 16:45:13,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:13,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686059231] [2025-02-05 16:45:13,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:13,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:45:13,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:45:13,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:13,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686059231] [2025-02-05 16:45:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686059231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:13,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042545214] [2025-02-05 16:45:13,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:13,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:13,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:13,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:13,377 INFO L87 Difference]: Start difference. First operand 1505 states and 1950 transitions. 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-02-05 16:45:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:14,156 INFO L93 Difference]: Finished difference Result 2031 states and 2656 transitions. [2025-02-05 16:45:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:14,156 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-02-05 16:45:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:14,160 INFO L225 Difference]: With dead ends: 2031 [2025-02-05 16:45:14,160 INFO L226 Difference]: Without dead ends: 1256 [2025-02-05 16:45:14,161 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-02-05 16:45:14,161 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 4919 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:14,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 779 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-02-05 16:45:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2025-02-05 16:45:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1234 states have (on average 1.3452188006482981) internal successors, (1660), 1255 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1660 transitions. [2025-02-05 16:45:14,183 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1660 transitions. Word has length 86 [2025-02-05 16:45:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:14,183 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1660 transitions. [2025-02-05 16:45:14,183 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-02-05 16:45:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1660 transitions. [2025-02-05 16:45:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:45:14,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:14,186 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-02-05 16:45:14,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:45:14,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:14,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1542236023, now seen corresponding path program 1 times [2025-02-05 16:45:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:14,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996489608] [2025-02-05 16:45:14,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:14,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:14,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:45:14,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:45:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:14,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996489608] [2025-02-05 16:45:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996489608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:14,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169526396] [2025-02-05 16:45:14,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:14,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:14,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:14,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:14,346 INFO L87 Difference]: Start difference. First operand 1256 states and 1660 transitions. 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-02-05 16:45:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:15,209 INFO L93 Difference]: Finished difference Result 1823 states and 2426 transitions. [2025-02-05 16:45:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:15,210 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-02-05 16:45:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:15,214 INFO L225 Difference]: With dead ends: 1823 [2025-02-05 16:45:15,214 INFO L226 Difference]: Without dead ends: 1192 [2025-02-05 16:45:15,215 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-02-05 16:45:15,217 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4624 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:15,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 697 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-02-05 16:45:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2025-02-05 16:45:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1170 states have (on average 1.3564102564102565) internal successors, (1587), 1191 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1587 transitions. [2025-02-05 16:45:15,235 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1587 transitions. Word has length 86 [2025-02-05 16:45:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:15,235 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1587 transitions. [2025-02-05 16:45:15,235 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-02-05 16:45:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1587 transitions. [2025-02-05 16:45:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:45:15,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:15,239 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-02-05 16:45:15,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:45:15,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:15,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash -209085593, now seen corresponding path program 1 times [2025-02-05 16:45:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:15,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598221913] [2025-02-05 16:45:15,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:15,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:15,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:45:15,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:45:15,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:15,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:15,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598221913] [2025-02-05 16:45:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598221913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661665887] [2025-02-05 16:45:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:15,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:15,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:15,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:15,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:15,394 INFO L87 Difference]: Start difference. First operand 1192 states and 1587 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-02-05 16:45:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:16,065 INFO L93 Difference]: Finished difference Result 1591 states and 2112 transitions. [2025-02-05 16:45:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:16,065 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-02-05 16:45:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:16,072 INFO L225 Difference]: With dead ends: 1591 [2025-02-05 16:45:16,072 INFO L226 Difference]: Without dead ends: 976 [2025-02-05 16:45:16,073 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-02-05 16:45:16,073 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 3836 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3836 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:16,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3836 Valid, 647 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-02-05 16:45:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-02-05 16:45:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 954 states have (on average 1.368972746331237) internal successors, (1306), 975 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1306 transitions. [2025-02-05 16:45:16,099 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1306 transitions. Word has length 87 [2025-02-05 16:45:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:16,099 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1306 transitions. [2025-02-05 16:45:16,099 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-02-05 16:45:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1306 transitions. [2025-02-05 16:45:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:45:16,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:16,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:16,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:45:16,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:16,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -954259636, now seen corresponding path program 1 times [2025-02-05 16:45:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:16,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897426431] [2025-02-05 16:45:16,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:16,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:45:16,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:45:16,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:16,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897426431] [2025-02-05 16:45:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897426431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:16,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:16,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926006452] [2025-02-05 16:45:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:16,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:16,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:16,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:16,310 INFO L87 Difference]: Start difference. First operand 976 states and 1306 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-02-05 16:45:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:16,746 INFO L93 Difference]: Finished difference Result 1165 states and 1524 transitions. [2025-02-05 16:45:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:16,746 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-02-05 16:45:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:16,749 INFO L225 Difference]: With dead ends: 1165 [2025-02-05 16:45:16,749 INFO L226 Difference]: Without dead ends: 682 [2025-02-05 16:45:16,750 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-02-05 16:45:16,750 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 2609 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2609 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:16,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2609 Valid, 491 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:45:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-05 16:45:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-02-05 16:45:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 660 states have (on average 1.3742424242424243) internal successors, (907), 681 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 907 transitions. [2025-02-05 16:45:16,759 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 907 transitions. Word has length 88 [2025-02-05 16:45:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:16,760 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 907 transitions. [2025-02-05 16:45:16,760 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-02-05 16:45:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 907 transitions. [2025-02-05 16:45:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:45:16,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:16,762 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-02-05 16:45:16,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:45:16,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:16,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash -283355437, now seen corresponding path program 1 times [2025-02-05 16:45:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017813557] [2025-02-05 16:45:16,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:16,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:45:16,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:45:16,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:16,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017813557] [2025-02-05 16:45:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017813557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:16,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780739415] [2025-02-05 16:45:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:16,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:16,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:16,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:16,879 INFO L87 Difference]: Start difference. First operand 682 states and 907 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-02-05 16:45:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:17,178 INFO L93 Difference]: Finished difference Result 1013 states and 1350 transitions. [2025-02-05 16:45:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:17,179 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-02-05 16:45:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:17,181 INFO L225 Difference]: With dead ends: 1013 [2025-02-05 16:45:17,181 INFO L226 Difference]: Without dead ends: 638 [2025-02-05 16:45:17,181 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-02-05 16:45:17,182 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2490 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2490 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:17,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2490 Valid, 488 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:45:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-05 16:45:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-02-05 16:45:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3831168831168832) internal successors, (852), 637 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 852 transitions. [2025-02-05 16:45:17,189 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 852 transitions. Word has length 89 [2025-02-05 16:45:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 852 transitions. [2025-02-05 16:45:17,190 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-02-05 16:45:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 852 transitions. [2025-02-05 16:45:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:45:17,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:17,191 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-02-05 16:45:17,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:45:17,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:17,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1636391385, now seen corresponding path program 1 times [2025-02-05 16:45:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:17,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678634889] [2025-02-05 16:45:17,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:17,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:45:17,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:45:17,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:17,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:17,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678634889] [2025-02-05 16:45:17,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678634889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:17,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:17,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:45:17,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313924150] [2025-02-05 16:45:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:17,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:45:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:17,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:45:17,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:45:17,593 INFO L87 Difference]: Start difference. First operand 638 states and 852 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 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-02-05 16:45:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:18,565 INFO L93 Difference]: Finished difference Result 1087 states and 1455 transitions. [2025-02-05 16:45:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 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-02-05 16:45:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:18,568 INFO L225 Difference]: With dead ends: 1087 [2025-02-05 16:45:18,568 INFO L226 Difference]: Without dead ends: 973 [2025-02-05 16:45:18,568 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-02-05 16:45:18,569 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 3606 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3606 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:18,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3606 Valid, 2461 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-02-05 16:45:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 638. [2025-02-05 16:45:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3814935064935066) internal successors, (851), 637 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 851 transitions. [2025-02-05 16:45:18,578 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 851 transitions. Word has length 90 [2025-02-05 16:45:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:18,578 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 851 transitions. [2025-02-05 16:45:18,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 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-02-05 16:45:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 851 transitions. [2025-02-05 16:45:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:45:18,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:18,580 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-02-05 16:45:18,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:45:18,580 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-02-05 16:45:18,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2004335607, now seen corresponding path program 1 times [2025-02-05 16:45:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253603883] [2025-02-05 16:45:18,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:18,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:45:18,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:45:18,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:18,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253603883] [2025-02-05 16:45:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253603883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:19,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:45:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794693311] [2025-02-05 16:45:19,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:45:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:19,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:45:19,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:45:19,061 INFO L87 Difference]: Start difference. First operand 638 states and 851 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 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-02-05 16:45:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:19,931 INFO L93 Difference]: Finished difference Result 1201 states and 1560 transitions. [2025-02-05 16:45:19,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:45:19,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 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-02-05 16:45:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:19,933 INFO L225 Difference]: With dead ends: 1201 [2025-02-05 16:45:19,933 INFO L226 Difference]: Without dead ends: 855 [2025-02-05 16:45:19,934 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-02-05 16:45:19,934 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 3448 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3448 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:19,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3448 Valid, 1726 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-02-05 16:45:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 638. [2025-02-05 16:45:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.37987012987013) internal successors, (850), 637 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 850 transitions. [2025-02-05 16:45:19,944 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 850 transitions. Word has length 90 [2025-02-05 16:45:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 850 transitions. [2025-02-05 16:45:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 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-02-05 16:45:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 850 transitions. [2025-02-05 16:45:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:45:19,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:19,946 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-02-05 16:45:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:45:19,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1435763157, now seen corresponding path program 1 times [2025-02-05 16:45:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733130718] [2025-02-05 16:45:19,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:19,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:45:19,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:45:20,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:20,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:20,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733130718] [2025-02-05 16:45:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733130718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:20,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820236669] [2025-02-05 16:45:20,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:20,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:20,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:20,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:20,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:20,228 INFO L87 Difference]: Start difference. First operand 638 states and 850 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-02-05 16:45:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:21,494 INFO L93 Difference]: Finished difference Result 1179 states and 1590 transitions. [2025-02-05 16:45:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:21,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-02-05 16:45:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:21,497 INFO L225 Difference]: With dead ends: 1179 [2025-02-05 16:45:21,497 INFO L226 Difference]: Without dead ends: 987 [2025-02-05 16:45:21,498 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-02-05 16:45:21,498 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 3442 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 3632 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:21,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 3632 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:45:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-02-05 16:45:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 638. [2025-02-05 16:45:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3782467532467533) internal successors, (849), 637 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 849 transitions. [2025-02-05 16:45:21,506 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 849 transitions. Word has length 90 [2025-02-05 16:45:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:21,506 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 849 transitions. [2025-02-05 16:45:21,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-02-05 16:45:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 849 transitions. [2025-02-05 16:45:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:45:21,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:21,507 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-02-05 16:45:21,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:45:21,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:21,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1149666633, now seen corresponding path program 1 times [2025-02-05 16:45:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065661300] [2025-02-05 16:45:21,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:21,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:45:21,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:45:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:21,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065661300] [2025-02-05 16:45:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065661300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:21,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:21,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291926974] [2025-02-05 16:45:21,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:21,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:21,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:21,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:21,729 INFO L87 Difference]: Start difference. First operand 638 states and 849 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-02-05 16:45:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:22,665 INFO L93 Difference]: Finished difference Result 1074 states and 1439 transitions. [2025-02-05 16:45:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-02-05 16:45:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:22,668 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 16:45:22,668 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:45:22,669 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-02-05 16:45:22,669 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 2208 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:22,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 2051 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:45:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-02-05 16:45:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3766233766233766) internal successors, (848), 637 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 848 transitions. [2025-02-05 16:45:22,678 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 848 transitions. Word has length 90 [2025-02-05 16:45:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:22,678 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 848 transitions. [2025-02-05 16:45:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-02-05 16:45:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 848 transitions. [2025-02-05 16:45:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:22,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:22,679 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-02-05 16:45:22,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:45:22,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:22,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1935630246, now seen corresponding path program 1 times [2025-02-05 16:45:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706109454] [2025-02-05 16:45:22,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:22,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:22,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:22,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:22,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:22,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706109454] [2025-02-05 16:45:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706109454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193731922] [2025-02-05 16:45:22,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:22,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:22,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:22,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:22,999 INFO L87 Difference]: Start difference. First operand 638 states and 848 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 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-02-05 16:45:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:24,214 INFO L93 Difference]: Finished difference Result 1140 states and 1524 transitions. [2025-02-05 16:45:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:45:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 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-02-05 16:45:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:24,217 INFO L225 Difference]: With dead ends: 1140 [2025-02-05 16:45:24,217 INFO L226 Difference]: Without dead ends: 987 [2025-02-05 16:45:24,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:45:24,219 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3172 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3172 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:24,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3172 Valid, 3259 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-02-05 16:45:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 641. [2025-02-05 16:45:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.3747980613893376) internal successors, (851), 640 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 851 transitions. [2025-02-05 16:45:24,229 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 851 transitions. Word has length 92 [2025-02-05 16:45:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:24,229 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 851 transitions. [2025-02-05 16:45:24,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 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-02-05 16:45:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 851 transitions. [2025-02-05 16:45:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:24,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:24,231 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-02-05 16:45:24,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:45:24,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1924025231, now seen corresponding path program 1 times [2025-02-05 16:45:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:24,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875200887] [2025-02-05 16:45:24,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:24,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:24,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:24,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:24,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875200887] [2025-02-05 16:45:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875200887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:24,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:24,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281635323] [2025-02-05 16:45:24,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:24,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:24,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:24,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:24,530 INFO L87 Difference]: Start difference. First operand 641 states and 851 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-02-05 16:45:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:25,567 INFO L93 Difference]: Finished difference Result 1209 states and 1613 transitions. [2025-02-05 16:45:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:25,568 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-02-05 16:45:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:25,570 INFO L225 Difference]: With dead ends: 1209 [2025-02-05 16:45:25,573 INFO L226 Difference]: Without dead ends: 987 [2025-02-05 16:45:25,574 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-02-05 16:45:25,575 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1841 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:25,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 2880 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:45:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-02-05 16:45:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 638. [2025-02-05 16:45:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.375) internal successors, (847), 637 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 847 transitions. [2025-02-05 16:45:25,595 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 847 transitions. Word has length 92 [2025-02-05 16:45:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 847 transitions. [2025-02-05 16:45:25,595 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-02-05 16:45:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 847 transitions. [2025-02-05 16:45:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:25,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:25,600 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-02-05 16:45:25,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:45:25,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 873540977, now seen corresponding path program 1 times [2025-02-05 16:45:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309293859] [2025-02-05 16:45:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:25,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:25,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:25,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:25,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309293859] [2025-02-05 16:45:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309293859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720206071] [2025-02-05 16:45:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:26,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:26,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:26,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:26,045 INFO L87 Difference]: Start difference. First operand 638 states and 847 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-02-05 16:45:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:27,182 INFO L93 Difference]: Finished difference Result 1120 states and 1502 transitions. [2025-02-05 16:45:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:27,182 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-02-05 16:45:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:27,185 INFO L225 Difference]: With dead ends: 1120 [2025-02-05 16:45:27,185 INFO L226 Difference]: Without dead ends: 982 [2025-02-05 16:45:27,185 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-02-05 16:45:27,186 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 2590 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:27,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 3657 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-02-05 16:45:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-02-05 16:45:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3733766233766234) internal successors, (846), 637 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 846 transitions. [2025-02-05 16:45:27,193 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 846 transitions. Word has length 92 [2025-02-05 16:45:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:27,193 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 846 transitions. [2025-02-05 16:45:27,193 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-02-05 16:45:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 846 transitions. [2025-02-05 16:45:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:27,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:27,194 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-02-05 16:45:27,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:45:27,194 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-02-05 16:45:27,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 519089657, now seen corresponding path program 1 times [2025-02-05 16:45:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:27,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346852657] [2025-02-05 16:45:27,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:27,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:27,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:27,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:27,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-02-05 16:45:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346852657] [2025-02-05 16:45:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346852657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:27,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:27,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625235476] [2025-02-05 16:45:27,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:27,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:27,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:27,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:27,368 INFO L87 Difference]: Start difference. First operand 638 states and 846 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-02-05 16:45:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:28,294 INFO L93 Difference]: Finished difference Result 1074 states and 1435 transitions. [2025-02-05 16:45:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:28,294 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-02-05 16:45:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:28,297 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 16:45:28,297 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:45:28,297 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-02-05 16:45:28,297 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 2954 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2954 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:28,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2954 Valid, 2497 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:45:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-02-05 16:45:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3717532467532467) internal successors, (845), 637 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 845 transitions. [2025-02-05 16:45:28,304 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 845 transitions. Word has length 92 [2025-02-05 16:45:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:28,304 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 845 transitions. [2025-02-05 16:45:28,305 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-02-05 16:45:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 845 transitions. [2025-02-05 16:45:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:28,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:28,306 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-02-05 16:45:28,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:45:28,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:28,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash -565292661, now seen corresponding path program 1 times [2025-02-05 16:45:28,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:28,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879435308] [2025-02-05 16:45:28,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:28,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:28,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:28,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:28,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:28,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879435308] [2025-02-05 16:45:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879435308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:28,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:28,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:28,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038880126] [2025-02-05 16:45:28,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:28,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:28,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:28,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:28,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:28,651 INFO L87 Difference]: Start difference. First operand 638 states and 845 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-02-05 16:45:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:29,772 INFO L93 Difference]: Finished difference Result 1120 states and 1503 transitions. [2025-02-05 16:45:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:29,773 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-02-05 16:45:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:29,775 INFO L225 Difference]: With dead ends: 1120 [2025-02-05 16:45:29,775 INFO L226 Difference]: Without dead ends: 982 [2025-02-05 16:45:29,776 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-02-05 16:45:29,776 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 2595 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2595 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:29,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2595 Valid, 3077 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-02-05 16:45:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-02-05 16:45:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.37012987012987) internal successors, (844), 637 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 844 transitions. [2025-02-05 16:45:29,783 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 844 transitions. Word has length 92 [2025-02-05 16:45:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:29,784 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 844 transitions. [2025-02-05 16:45:29,784 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-02-05 16:45:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 844 transitions. [2025-02-05 16:45:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:29,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:29,785 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-02-05 16:45:29,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:45:29,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:29,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash -537578646, now seen corresponding path program 1 times [2025-02-05 16:45:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763296277] [2025-02-05 16:45:29,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:29,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:29,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:29,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:30,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:30,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763296277] [2025-02-05 16:45:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763296277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:30,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:30,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651780814] [2025-02-05 16:45:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:30,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:30,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:30,003 INFO L87 Difference]: Start difference. First operand 638 states and 844 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-02-05 16:45:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:30,860 INFO L93 Difference]: Finished difference Result 1006 states and 1323 transitions. [2025-02-05 16:45:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:30,861 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-02-05 16:45:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:30,863 INFO L225 Difference]: With dead ends: 1006 [2025-02-05 16:45:30,863 INFO L226 Difference]: Without dead ends: 927 [2025-02-05 16:45:30,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:45:30,865 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 2291 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:30,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 1865 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-02-05 16:45:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 638. [2025-02-05 16:45:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3685064935064934) internal successors, (843), 637 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 843 transitions. [2025-02-05 16:45:30,871 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 843 transitions. Word has length 92 [2025-02-05 16:45:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:30,871 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 843 transitions. [2025-02-05 16:45:30,871 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-02-05 16:45:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 843 transitions. [2025-02-05 16:45:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:30,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:30,873 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-02-05 16:45:30,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:45:30,873 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:30,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash -202173863, now seen corresponding path program 1 times [2025-02-05 16:45:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442548845] [2025-02-05 16:45:30,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:30,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:30,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:30,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:30,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:31,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:31,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442548845] [2025-02-05 16:45:31,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442548845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:31,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:31,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:31,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692524091] [2025-02-05 16:45:31,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:31,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:31,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:31,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:31,139 INFO L87 Difference]: Start difference. First operand 638 states and 843 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-02-05 16:45:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:32,099 INFO L93 Difference]: Finished difference Result 1106 states and 1484 transitions. [2025-02-05 16:45:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:32,100 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-02-05 16:45:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:32,102 INFO L225 Difference]: With dead ends: 1106 [2025-02-05 16:45:32,102 INFO L226 Difference]: Without dead ends: 982 [2025-02-05 16:45:32,102 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-02-05 16:45:32,103 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 3680 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3680 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:32,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3680 Valid, 2906 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-02-05 16:45:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-02-05 16:45:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3668831168831168) internal successors, (842), 637 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 842 transitions. [2025-02-05 16:45:32,109 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 842 transitions. Word has length 92 [2025-02-05 16:45:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:32,109 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 842 transitions. [2025-02-05 16:45:32,109 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-02-05 16:45:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 842 transitions. [2025-02-05 16:45:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:32,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:32,110 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-02-05 16:45:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:45:32,110 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:32,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash 82588328, now seen corresponding path program 1 times [2025-02-05 16:45:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:32,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013755905] [2025-02-05 16:45:32,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:32,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:32,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:32,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:32,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:32,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013755905] [2025-02-05 16:45:32,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013755905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:32,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:32,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:32,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036487284] [2025-02-05 16:45:32,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:32,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:32,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:32,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:32,436 INFO L87 Difference]: Start difference. First operand 638 states and 842 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-02-05 16:45:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:33,380 INFO L93 Difference]: Finished difference Result 1069 states and 1427 transitions. [2025-02-05 16:45:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:33,382 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-02-05 16:45:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:33,384 INFO L225 Difference]: With dead ends: 1069 [2025-02-05 16:45:33,384 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:45:33,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:45:33,385 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 4033 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4033 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:33,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4033 Valid, 2570 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:45:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-02-05 16:45:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 637 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 841 transitions. [2025-02-05 16:45:33,397 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 841 transitions. Word has length 92 [2025-02-05 16:45:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:33,397 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 841 transitions. [2025-02-05 16:45:33,397 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-02-05 16:45:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 841 transitions. [2025-02-05 16:45:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:33,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:33,403 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-02-05 16:45:33,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:45:33,403 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:33,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1380036454, now seen corresponding path program 1 times [2025-02-05 16:45:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038516244] [2025-02-05 16:45:33,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:33,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:33,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:33,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:33,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038516244] [2025-02-05 16:45:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038516244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198725467] [2025-02-05 16:45:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:33,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:33,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:33,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:33,736 INFO L87 Difference]: Start difference. First operand 638 states and 841 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-02-05 16:45:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:34,620 INFO L93 Difference]: Finished difference Result 1135 states and 1509 transitions. [2025-02-05 16:45:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:34,621 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-02-05 16:45:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:34,623 INFO L225 Difference]: With dead ends: 1135 [2025-02-05 16:45:34,623 INFO L226 Difference]: Without dead ends: 982 [2025-02-05 16:45:34,624 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-02-05 16:45:34,624 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 3390 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:34,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 3077 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-02-05 16:45:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 638. [2025-02-05 16:45:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3636363636363635) internal successors, (840), 637 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 840 transitions. [2025-02-05 16:45:34,630 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 840 transitions. Word has length 94 [2025-02-05 16:45:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:34,630 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 840 transitions. [2025-02-05 16:45:34,630 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-02-05 16:45:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 840 transitions. [2025-02-05 16:45:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:34,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:34,635 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-02-05 16:45:34,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:45:34,635 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:34,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1815348273, now seen corresponding path program 1 times [2025-02-05 16:45:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287985681] [2025-02-05 16:45:34,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:34,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:34,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:34,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:34,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287985681] [2025-02-05 16:45:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287985681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010471124] [2025-02-05 16:45:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:35,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:35,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:35,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:35,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:35,078 INFO L87 Difference]: Start difference. First operand 638 states and 840 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-02-05 16:45:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:35,893 INFO L93 Difference]: Finished difference Result 1083 states and 1438 transitions. [2025-02-05 16:45:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:35,893 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-02-05 16:45:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:35,895 INFO L225 Difference]: With dead ends: 1083 [2025-02-05 16:45:35,896 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:45:35,896 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-02-05 16:45:35,896 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 3733 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3733 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:35,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3733 Valid, 2814 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:45:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-02-05 16:45:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3620129870129871) internal successors, (839), 637 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 839 transitions. [2025-02-05 16:45:35,923 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 839 transitions. Word has length 94 [2025-02-05 16:45:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:35,924 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 839 transitions. [2025-02-05 16:45:35,927 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-02-05 16:45:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 839 transitions. [2025-02-05 16:45:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:35,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:35,928 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-02-05 16:45:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:45:35,929 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2032479125, now seen corresponding path program 1 times [2025-02-05 16:45:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710610403] [2025-02-05 16:45:35,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:35,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:36,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:36,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:36,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710610403] [2025-02-05 16:45:36,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710610403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:36,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:36,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:36,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313672248] [2025-02-05 16:45:36,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:36,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:36,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:36,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:36,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:36,262 INFO L87 Difference]: Start difference. First operand 638 states and 839 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-02-05 16:45:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:37,174 INFO L93 Difference]: Finished difference Result 1045 states and 1383 transitions. [2025-02-05 16:45:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:37,175 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-02-05 16:45:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:37,177 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 16:45:37,177 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:45:37,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:45:37,177 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 3657 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3657 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:37,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3657 Valid, 2908 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:45:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-02-05 16:45:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3603896103896105) internal successors, (838), 637 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 838 transitions. [2025-02-05 16:45:37,183 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 838 transitions. Word has length 94 [2025-02-05 16:45:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:37,183 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 838 transitions. [2025-02-05 16:45:37,184 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-02-05 16:45:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 838 transitions. [2025-02-05 16:45:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:37,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:37,185 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-02-05 16:45:37,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:45:37,185 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:37,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 137644418, now seen corresponding path program 1 times [2025-02-05 16:45:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:37,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608971341] [2025-02-05 16:45:37,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:37,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:37,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:37,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:37,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608971341] [2025-02-05 16:45:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608971341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742533874] [2025-02-05 16:45:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:37,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:37,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:37,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:37,355 INFO L87 Difference]: Start difference. First operand 638 states and 838 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-02-05 16:45:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:38,386 INFO L93 Difference]: Finished difference Result 1083 states and 1434 transitions. [2025-02-05 16:45:38,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:38,389 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-02-05 16:45:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:38,391 INFO L225 Difference]: With dead ends: 1083 [2025-02-05 16:45:38,391 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:45:38,391 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-02-05 16:45:38,393 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 2674 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 3316 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:38,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 3316 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2562 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:45:38,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:45:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-02-05 16:45:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3587662337662338) internal successors, (837), 637 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 837 transitions. [2025-02-05 16:45:38,399 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 837 transitions. Word has length 94 [2025-02-05 16:45:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:38,400 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 837 transitions. [2025-02-05 16:45:38,400 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-02-05 16:45:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 837 transitions. [2025-02-05 16:45:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:38,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:38,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, 1, 1] [2025-02-05 16:45:38,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:45:38,401 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1748613512, now seen corresponding path program 1 times [2025-02-05 16:45:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170640642] [2025-02-05 16:45:38,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:38,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:38,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:38,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:38,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170640642] [2025-02-05 16:45:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170640642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:38,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:38,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:38,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591269702] [2025-02-05 16:45:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:38,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:38,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:38,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:38,588 INFO L87 Difference]: Start difference. First operand 638 states and 837 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-02-05 16:45:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:39,541 INFO L93 Difference]: Finished difference Result 1045 states and 1380 transitions. [2025-02-05 16:45:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:39,541 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-02-05 16:45:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:39,544 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 16:45:39,544 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:45:39,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:45:39,545 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 3568 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3568 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:39,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3568 Valid, 2517 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:45:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-02-05 16:45:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3571428571428572) internal successors, (836), 637 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 836 transitions. [2025-02-05 16:45:39,553 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 836 transitions. Word has length 94 [2025-02-05 16:45:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:39,553 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 836 transitions. [2025-02-05 16:45:39,553 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-02-05 16:45:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 836 transitions. [2025-02-05 16:45:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:39,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:39,554 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-02-05 16:45:39,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:45:39,555 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-02-05 16:45:39,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1126271269, now seen corresponding path program 1 times [2025-02-05 16:45:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209227765] [2025-02-05 16:45:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:39,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:39,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:39,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:39,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209227765] [2025-02-05 16:45:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209227765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222170233] [2025-02-05 16:45:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:39,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:39,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:39,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:39,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:39,862 INFO L87 Difference]: Start difference. First operand 638 states and 836 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-02-05 16:45:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:40,829 INFO L93 Difference]: Finished difference Result 1045 states and 1379 transitions. [2025-02-05 16:45:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:40,830 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-02-05 16:45:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:40,832 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 16:45:40,832 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:45:40,832 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-02-05 16:45:40,833 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2970 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2970 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:40,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2970 Valid, 2496 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:45:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-02-05 16:45:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3555194805194806) internal successors, (835), 637 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 835 transitions. [2025-02-05 16:45:40,842 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 835 transitions. Word has length 94 [2025-02-05 16:45:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:40,842 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 835 transitions. [2025-02-05 16:45:40,842 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-02-05 16:45:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 835 transitions. [2025-02-05 16:45:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:40,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:40,843 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-02-05 16:45:40,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:45:40,843 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:40,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2048964979, now seen corresponding path program 1 times [2025-02-05 16:45:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:40,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522705965] [2025-02-05 16:45:40,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:40,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:40,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:40,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:40,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522705965] [2025-02-05 16:45:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522705965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:41,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804378557] [2025-02-05 16:45:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:41,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:41,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:41,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:41,012 INFO L87 Difference]: Start difference. First operand 638 states and 835 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-02-05 16:45:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:41,784 INFO L93 Difference]: Finished difference Result 1003 states and 1310 transitions. [2025-02-05 16:45:41,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:41,784 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-02-05 16:45:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:41,786 INFO L225 Difference]: With dead ends: 1003 [2025-02-05 16:45:41,786 INFO L226 Difference]: Without dead ends: 927 [2025-02-05 16:45:41,786 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-02-05 16:45:41,787 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 3295 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:41,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3295 Valid, 1965 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-02-05 16:45:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 638. [2025-02-05 16:45:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.353896103896104) internal successors, (834), 637 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 834 transitions. [2025-02-05 16:45:41,793 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 834 transitions. Word has length 94 [2025-02-05 16:45:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:41,793 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 834 transitions. [2025-02-05 16:45:41,793 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-02-05 16:45:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 834 transitions. [2025-02-05 16:45:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:41,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:41,794 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-02-05 16:45:41,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:45:41,794 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:41,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1182169636, now seen corresponding path program 1 times [2025-02-05 16:45:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854495199] [2025-02-05 16:45:41,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:41,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:41,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:41,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:41,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854495199] [2025-02-05 16:45:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854495199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661142078] [2025-02-05 16:45:41,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:42,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:42,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:42,004 INFO L87 Difference]: Start difference. First operand 638 states and 834 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-02-05 16:45:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:42,864 INFO L93 Difference]: Finished difference Result 1050 states and 1381 transitions. [2025-02-05 16:45:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:42,865 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-02-05 16:45:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:42,867 INFO L225 Difference]: With dead ends: 1050 [2025-02-05 16:45:42,867 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:45:42,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:45:42,878 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1964 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:42,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 2508 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:45:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-02-05 16:45:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3522727272727273) internal successors, (833), 637 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 833 transitions. [2025-02-05 16:45:42,890 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 833 transitions. Word has length 94 [2025-02-05 16:45:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 833 transitions. [2025-02-05 16:45:42,890 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-02-05 16:45:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 833 transitions. [2025-02-05 16:45:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:42,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:42,891 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-02-05 16:45:42,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:45:42,891 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:42,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:42,892 INFO L85 PathProgramCache]: Analyzing trace with hash 125302526, now seen corresponding path program 1 times [2025-02-05 16:45:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:42,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73734239] [2025-02-05 16:45:42,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:42,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:42,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:42,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:42,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:42,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73734239] [2025-02-05 16:45:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73734239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:43,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48962073] [2025-02-05 16:45:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:43,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:43,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:43,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:43,245 INFO L87 Difference]: Start difference. First operand 638 states and 833 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-02-05 16:45:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:44,850 INFO L93 Difference]: Finished difference Result 1345 states and 1813 transitions. [2025-02-05 16:45:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:45:44,850 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-02-05 16:45:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:44,855 INFO L225 Difference]: With dead ends: 1345 [2025-02-05 16:45:44,855 INFO L226 Difference]: Without dead ends: 1237 [2025-02-05 16:45:44,855 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-02-05 16:45:44,856 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 5064 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5064 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:44,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5064 Valid, 3533 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:45:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-02-05 16:45:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 642. [2025-02-05 16:45:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.35) internal successors, (837), 641 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 837 transitions. [2025-02-05 16:45:44,862 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 837 transitions. Word has length 94 [2025-02-05 16:45:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:44,862 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 837 transitions. [2025-02-05 16:45:44,862 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-02-05 16:45:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 837 transitions. [2025-02-05 16:45:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:44,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:44,863 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-02-05 16:45:44,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:45:44,863 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:44,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash -974844295, now seen corresponding path program 1 times [2025-02-05 16:45:44,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:44,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563829612] [2025-02-05 16:45:44,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:44,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:44,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:44,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:44,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:45,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:45,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563829612] [2025-02-05 16:45:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563829612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:45,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:45,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532152870] [2025-02-05 16:45:45,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:45,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:45,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:45,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:45,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:45,058 INFO L87 Difference]: Start difference. First operand 642 states and 837 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-02-05 16:45:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:46,044 INFO L93 Difference]: Finished difference Result 1049 states and 1379 transitions. [2025-02-05 16:45:46,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:46,044 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-02-05 16:45:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:46,046 INFO L225 Difference]: With dead ends: 1049 [2025-02-05 16:45:46,049 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 16:45:46,050 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-02-05 16:45:46,051 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 3590 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3590 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:46,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3590 Valid, 3004 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:45:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 16:45:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-02-05 16:45:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3483870967741935) internal successors, (836), 641 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 836 transitions. [2025-02-05 16:45:46,058 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 836 transitions. Word has length 94 [2025-02-05 16:45:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:46,059 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 836 transitions. [2025-02-05 16:45:46,059 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-02-05 16:45:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 836 transitions. [2025-02-05 16:45:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:46,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:46,060 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-02-05 16:45:46,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:45:46,060 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:46,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1371188463, now seen corresponding path program 1 times [2025-02-05 16:45:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:46,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710563158] [2025-02-05 16:45:46,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:46,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:46,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:46,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:46,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710563158] [2025-02-05 16:45:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710563158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:46,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862151759] [2025-02-05 16:45:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:46,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:46,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:46,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:46,397 INFO L87 Difference]: Start difference. First operand 642 states and 836 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-02-05 16:45:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:47,263 INFO L93 Difference]: Finished difference Result 1074 states and 1416 transitions. [2025-02-05 16:45:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:47,264 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-02-05 16:45:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:47,266 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 16:45:47,267 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:45:47,267 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-02-05 16:45:47,268 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 3825 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3825 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:47,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3825 Valid, 2710 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:45:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 642. [2025-02-05 16:45:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.346774193548387) internal successors, (835), 641 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 835 transitions. [2025-02-05 16:45:47,273 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 835 transitions. Word has length 94 [2025-02-05 16:45:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:47,273 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 835 transitions. [2025-02-05 16:45:47,273 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-02-05 16:45:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 835 transitions. [2025-02-05 16:45:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:47,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:47,274 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-02-05 16:45:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:45:47,274 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:47,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2038755885, now seen corresponding path program 1 times [2025-02-05 16:45:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449765868] [2025-02-05 16:45:47,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:47,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:47,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:47,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:47,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449765868] [2025-02-05 16:45:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449765868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:47,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:47,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:47,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526974901] [2025-02-05 16:45:47,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:47,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:47,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:47,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:47,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:47,460 INFO L87 Difference]: Start difference. First operand 642 states and 835 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-02-05 16:45:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:48,439 INFO L93 Difference]: Finished difference Result 1045 states and 1373 transitions. [2025-02-05 16:45:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:48,440 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-02-05 16:45:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:48,442 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 16:45:48,442 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 16:45:48,442 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-02-05 16:45:48,443 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 3548 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3548 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:48,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3548 Valid, 3080 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:45:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 16:45:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-02-05 16:45:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3451612903225807) internal successors, (834), 641 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 834 transitions. [2025-02-05 16:45:48,449 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 834 transitions. Word has length 94 [2025-02-05 16:45:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:48,449 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 834 transitions. [2025-02-05 16:45:48,449 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-02-05 16:45:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 834 transitions. [2025-02-05 16:45:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:48,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:48,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:48,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:45:48,450 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:48,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1714822152, now seen corresponding path program 1 times [2025-02-05 16:45:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484911711] [2025-02-05 16:45:48,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:48,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:48,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:48,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:48,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484911711] [2025-02-05 16:45:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484911711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:48,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:48,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:48,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406281369] [2025-02-05 16:45:48,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:48,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:48,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:48,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:48,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:48,759 INFO L87 Difference]: Start difference. First operand 642 states and 834 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-02-05 16:45:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:49,540 INFO L93 Difference]: Finished difference Result 1049 states and 1375 transitions. [2025-02-05 16:45:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:49,540 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-02-05 16:45:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:49,542 INFO L225 Difference]: With dead ends: 1049 [2025-02-05 16:45:49,542 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 16:45:49,542 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-02-05 16:45:49,543 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 2882 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2882 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:49,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2882 Valid, 2572 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 16:45:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-02-05 16:45:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3435483870967742) internal successors, (833), 641 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2025-02-05 16:45:49,557 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 94 [2025-02-05 16:45:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:49,557 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2025-02-05 16:45:49,557 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-02-05 16:45:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2025-02-05 16:45:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:49,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:49,557 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-02-05 16:45:49,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:45:49,558 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:49,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash -766706055, now seen corresponding path program 1 times [2025-02-05 16:45:49,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403284482] [2025-02-05 16:45:49,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:49,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:49,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:49,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:49,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403284482] [2025-02-05 16:45:49,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403284482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531812117] [2025-02-05 16:45:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:49,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:49,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:49,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:49,895 INFO L87 Difference]: Start difference. First operand 642 states and 833 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-02-05 16:45:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:50,923 INFO L93 Difference]: Finished difference Result 1045 states and 1370 transitions. [2025-02-05 16:45:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:50,923 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-02-05 16:45:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:50,925 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 16:45:50,925 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 16:45:50,926 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-02-05 16:45:50,926 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 3442 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:50,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 3298 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:45:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 16:45:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-02-05 16:45:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3419354838709678) internal successors, (832), 641 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2025-02-05 16:45:50,933 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 94 [2025-02-05 16:45:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:50,933 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2025-02-05 16:45:50,934 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-02-05 16:45:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2025-02-05 16:45:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:45:50,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:50,934 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-02-05 16:45:50,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:45:50,935 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:50,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:50,935 INFO L85 PathProgramCache]: Analyzing trace with hash -424007258, now seen corresponding path program 1 times [2025-02-05 16:45:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:50,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726375214] [2025-02-05 16:45:50,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:50,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:50,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:45:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:45:50,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726375214] [2025-02-05 16:45:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726375214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442264579] [2025-02-05 16:45:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:51,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:51,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:51,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:51,077 INFO L87 Difference]: Start difference. First operand 642 states and 832 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-02-05 16:45:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:51,981 INFO L93 Difference]: Finished difference Result 1045 states and 1369 transitions. [2025-02-05 16:45:51,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:51,982 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-02-05 16:45:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:51,983 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 16:45:51,983 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 16:45:51,984 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-02-05 16:45:51,984 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 2877 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2877 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:51,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2877 Valid, 2572 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 16:45:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 642. [2025-02-05 16:45:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3403225806451613) internal successors, (831), 641 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 831 transitions. [2025-02-05 16:45:51,990 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 831 transitions. Word has length 94 [2025-02-05 16:45:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:51,990 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 831 transitions. [2025-02-05 16:45:51,990 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-02-05 16:45:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 831 transitions. [2025-02-05 16:45:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:45:51,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:51,991 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-02-05 16:45:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:45:51,991 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1104587278, now seen corresponding path program 1 times [2025-02-05 16:45:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527883005] [2025-02-05 16:45:51,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:52,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:45:52,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:45:52,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:52,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:52,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527883005] [2025-02-05 16:45:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527883005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562016679] [2025-02-05 16:45:52,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:52,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:52,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:52,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:52,148 INFO L87 Difference]: Start difference. First operand 642 states and 831 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-02-05 16:45:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:53,074 INFO L93 Difference]: Finished difference Result 1083 states and 1417 transitions. [2025-02-05 16:45:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:53,074 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-02-05 16:45:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:53,076 INFO L225 Difference]: With dead ends: 1083 [2025-02-05 16:45:53,076 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:45:53,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:45:53,077 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 3678 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3678 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:53,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3678 Valid, 2799 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:45:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 638. [2025-02-05 16:45:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3409090909090908) internal successors, (826), 637 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 826 transitions. [2025-02-05 16:45:53,082 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 826 transitions. Word has length 95 [2025-02-05 16:45:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:53,082 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 826 transitions. [2025-02-05 16:45:53,082 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-02-05 16:45:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 826 transitions. [2025-02-05 16:45:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:45:53,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:53,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, 1] [2025-02-05 16:45:53,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:45:53,083 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:53,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1491027213, now seen corresponding path program 1 times [2025-02-05 16:45:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:53,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621171874] [2025-02-05 16:45:53,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:53,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:53,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:45:53,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:45:53,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:53,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:53,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:53,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621171874] [2025-02-05 16:45:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621171874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:53,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:53,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844029102] [2025-02-05 16:45:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:53,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:53,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:53,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:53,269 INFO L87 Difference]: Start difference. First operand 638 states and 826 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-02-05 16:45:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:54,295 INFO L93 Difference]: Finished difference Result 1040 states and 1361 transitions. [2025-02-05 16:45:54,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:54,296 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-02-05 16:45:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:54,297 INFO L225 Difference]: With dead ends: 1040 [2025-02-05 16:45:54,297 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:45:54,298 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-02-05 16:45:54,298 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 3392 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3392 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:54,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3392 Valid, 3386 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:45:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:45:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 638. [2025-02-05 16:45:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 616 states have (on average 1.3392857142857142) internal successors, (825), 637 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 825 transitions. [2025-02-05 16:45:54,303 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 825 transitions. Word has length 95 [2025-02-05 16:45:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:54,303 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 825 transitions. [2025-02-05 16:45:54,303 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-02-05 16:45:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 825 transitions. [2025-02-05 16:45:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:54,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:54,304 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-02-05 16:45:54,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:45:54,304 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:54,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash -781771315, now seen corresponding path program 1 times [2025-02-05 16:45:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:54,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828571865] [2025-02-05 16:45:54,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:54,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828571865] [2025-02-05 16:45:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828571865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:54,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067793621] [2025-02-05 16:45:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:54,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:54,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:54,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:54,738 INFO L87 Difference]: Start difference. First operand 638 states and 825 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-02-05 16:45:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:56,010 INFO L93 Difference]: Finished difference Result 1272 states and 1695 transitions. [2025-02-05 16:45:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:45:56,010 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-02-05 16:45:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:56,012 INFO L225 Difference]: With dead ends: 1272 [2025-02-05 16:45:56,012 INFO L226 Difference]: Without dead ends: 1181 [2025-02-05 16:45:56,013 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-02-05 16:45:56,013 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 5975 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5975 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:56,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5975 Valid, 3050 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-02-05 16:45:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 642. [2025-02-05 16:45:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3370967741935484) internal successors, (829), 641 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 829 transitions. [2025-02-05 16:45:56,018 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 829 transitions. Word has length 96 [2025-02-05 16:45:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:56,019 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 829 transitions. [2025-02-05 16:45:56,019 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-02-05 16:45:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 829 transitions. [2025-02-05 16:45:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:56,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:56,020 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-02-05 16:45:56,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:45:56,020 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:56,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1550497711, now seen corresponding path program 1 times [2025-02-05 16:45:56,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:56,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144367106] [2025-02-05 16:45:56,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:56,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:56,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:56,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:56,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:56,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:56,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144367106] [2025-02-05 16:45:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144367106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:56,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:56,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275380065] [2025-02-05 16:45:56,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:56,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:56,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:56,166 INFO L87 Difference]: Start difference. First operand 642 states and 829 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-02-05 16:45:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:56,877 INFO L93 Difference]: Finished difference Result 1010 states and 1306 transitions. [2025-02-05 16:45:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:56,877 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-02-05 16:45:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:56,878 INFO L225 Difference]: With dead ends: 1010 [2025-02-05 16:45:56,878 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:45:56,879 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-02-05 16:45:56,879 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1992 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:56,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 2358 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:45:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:45:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.335483870967742) internal successors, (828), 641 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 828 transitions. [2025-02-05 16:45:56,885 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 828 transitions. Word has length 96 [2025-02-05 16:45:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:56,886 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 828 transitions. [2025-02-05 16:45:56,886 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-02-05 16:45:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 828 transitions. [2025-02-05 16:45:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:56,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:56,887 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-02-05 16:45:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:45:56,887 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:56,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:56,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1225873890, now seen corresponding path program 1 times [2025-02-05 16:45:56,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:56,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779924738] [2025-02-05 16:45:56,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:56,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:56,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:56,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:56,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:57,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-02-05 16:45:57,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:57,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779924738] [2025-02-05 16:45:57,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779924738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:57,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:57,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993107887] [2025-02-05 16:45:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:57,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:57,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:57,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:57,060 INFO L87 Difference]: Start difference. First operand 642 states and 828 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-02-05 16:45:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:57,983 INFO L93 Difference]: Finished difference Result 1010 states and 1305 transitions. [2025-02-05 16:45:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:57,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-05 16:45:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:57,985 INFO L225 Difference]: With dead ends: 1010 [2025-02-05 16:45:57,985 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:45:57,986 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-02-05 16:45:57,986 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2889 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2889 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:57,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2889 Valid, 2602 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:45:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:45:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3338709677419356) internal successors, (827), 641 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 827 transitions. [2025-02-05 16:45:58,001 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 827 transitions. Word has length 96 [2025-02-05 16:45:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:58,001 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 827 transitions. [2025-02-05 16:45:58,001 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-02-05 16:45:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 827 transitions. [2025-02-05 16:45:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:58,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:58,002 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-02-05 16:45:58,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:45:58,002 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:58,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1121539455, now seen corresponding path program 1 times [2025-02-05 16:45:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839633099] [2025-02-05 16:45:58,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:58,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:58,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839633099] [2025-02-05 16:45:58,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839633099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:58,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:58,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:58,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842377380] [2025-02-05 16:45:58,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:58,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:58,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:58,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:58,243 INFO L87 Difference]: Start difference. First operand 642 states and 827 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-02-05 16:45:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:59,034 INFO L93 Difference]: Finished difference Result 1007 states and 1300 transitions. [2025-02-05 16:45:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:59,034 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-02-05 16:45:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:59,035 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 16:45:59,035 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:45:59,036 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-02-05 16:45:59,036 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 4127 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4127 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:59,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4127 Valid, 2168 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:45:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:45:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.332258064516129) internal successors, (826), 641 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 826 transitions. [2025-02-05 16:45:59,042 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 826 transitions. Word has length 96 [2025-02-05 16:45:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:59,042 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 826 transitions. [2025-02-05 16:45:59,042 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-02-05 16:45:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 826 transitions. [2025-02-05 16:45:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:59,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:59,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] [2025-02-05 16:45:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:45:59,043 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2077132105, now seen corresponding path program 1 times [2025-02-05 16:45:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002598613] [2025-02-05 16:45:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:59,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:59,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:59,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:59,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:59,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002598613] [2025-02-05 16:45:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002598613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367657450] [2025-02-05 16:45:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:59,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:59,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:59,320 INFO L87 Difference]: Start difference. First operand 642 states and 826 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-02-05 16:46:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:00,277 INFO L93 Difference]: Finished difference Result 1050 states and 1364 transitions. [2025-02-05 16:46:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:00,279 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-02-05 16:46:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:00,280 INFO L225 Difference]: With dead ends: 1050 [2025-02-05 16:46:00,281 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:46:00,281 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-02-05 16:46:00,281 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 3486 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3486 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:00,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3486 Valid, 3132 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:46:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:46:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 642. [2025-02-05 16:46:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3306451612903225) internal successors, (825), 641 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 825 transitions. [2025-02-05 16:46:00,287 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 825 transitions. Word has length 96 [2025-02-05 16:46:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 825 transitions. [2025-02-05 16:46:00,287 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-02-05 16:46:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 825 transitions. [2025-02-05 16:46:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:00,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:00,288 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-02-05 16:46:00,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:46:00,288 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:00,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash 114433835, now seen corresponding path program 1 times [2025-02-05 16:46:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:00,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747425364] [2025-02-05 16:46:00,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:00,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:00,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:00,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:00,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:00,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-02-05 16:46:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747425364] [2025-02-05 16:46:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747425364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091221557] [2025-02-05 16:46:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:00,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:00,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:00,493 INFO L87 Difference]: Start difference. First operand 642 states and 825 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-02-05 16:46:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:01,294 INFO L93 Difference]: Finished difference Result 1010 states and 1301 transitions. [2025-02-05 16:46:01,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:01,294 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-02-05 16:46:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:01,296 INFO L225 Difference]: With dead ends: 1010 [2025-02-05 16:46:01,296 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:01,296 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-02-05 16:46:01,297 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 4001 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4001 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:01,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4001 Valid, 2224 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3290322580645162) internal successors, (824), 641 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 824 transitions. [2025-02-05 16:46:01,302 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 824 transitions. Word has length 96 [2025-02-05 16:46:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:01,303 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 824 transitions. [2025-02-05 16:46:01,303 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-02-05 16:46:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 824 transitions. [2025-02-05 16:46:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:01,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:01,304 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-02-05 16:46:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:46:01,304 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:01,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash -692269888, now seen corresponding path program 1 times [2025-02-05 16:46:01,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:01,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251388548] [2025-02-05 16:46:01,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:01,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:01,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:01,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:01,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:01,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251388548] [2025-02-05 16:46:01,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251388548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:01,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:01,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129473632] [2025-02-05 16:46:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:01,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:01,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:01,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:01,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:01,516 INFO L87 Difference]: Start difference. First operand 642 states and 824 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-02-05 16:46:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:02,395 INFO L93 Difference]: Finished difference Result 976 states and 1251 transitions. [2025-02-05 16:46:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:02,396 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-02-05 16:46:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:02,397 INFO L225 Difference]: With dead ends: 976 [2025-02-05 16:46:02,397 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:46:02,398 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-02-05 16:46:02,399 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 1874 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:02,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 2624 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:46:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:46:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 642. [2025-02-05 16:46:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3274193548387097) internal successors, (823), 641 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 823 transitions. [2025-02-05 16:46:02,409 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 823 transitions. Word has length 96 [2025-02-05 16:46:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:02,413 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 823 transitions. [2025-02-05 16:46:02,413 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-02-05 16:46:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 823 transitions. [2025-02-05 16:46:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:02,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:02,417 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-02-05 16:46:02,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:46:02,418 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1639999138, now seen corresponding path program 1 times [2025-02-05 16:46:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604152069] [2025-02-05 16:46:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:02,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:02,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:02,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:02,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604152069] [2025-02-05 16:46:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604152069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:02,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:02,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:02,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255618056] [2025-02-05 16:46:02,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:02,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:02,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:02,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:02,634 INFO L87 Difference]: Start difference. First operand 642 states and 823 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-02-05 16:46:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:03,352 INFO L93 Difference]: Finished difference Result 936 states and 1188 transitions. [2025-02-05 16:46:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:03,352 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-02-05 16:46:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:03,354 INFO L225 Difference]: With dead ends: 936 [2025-02-05 16:46:03,354 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:03,354 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-02-05 16:46:03,354 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 3577 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3577 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:03,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3577 Valid, 2278 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3258064516129033) internal successors, (822), 641 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 822 transitions. [2025-02-05 16:46:03,360 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 822 transitions. Word has length 96 [2025-02-05 16:46:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:03,360 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 822 transitions. [2025-02-05 16:46:03,360 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-02-05 16:46:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 822 transitions. [2025-02-05 16:46:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:03,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:03,361 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-02-05 16:46:03,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 16:46:03,361 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:03,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:03,361 INFO L85 PathProgramCache]: Analyzing trace with hash -921482987, now seen corresponding path program 1 times [2025-02-05 16:46:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:03,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792945848] [2025-02-05 16:46:03,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:03,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:03,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:03,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:03,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:03,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:03,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792945848] [2025-02-05 16:46:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792945848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250183028] [2025-02-05 16:46:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:03,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:03,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:03,510 INFO L87 Difference]: Start difference. First operand 642 states and 822 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-02-05 16:46:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:04,185 INFO L93 Difference]: Finished difference Result 936 states and 1187 transitions. [2025-02-05 16:46:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:04,186 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-02-05 16:46:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:04,187 INFO L225 Difference]: With dead ends: 936 [2025-02-05 16:46:04,187 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:04,188 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-02-05 16:46:04,188 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 2964 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:04,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 2257 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3241935483870968) internal successors, (821), 641 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 821 transitions. [2025-02-05 16:46:04,192 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 821 transitions. Word has length 96 [2025-02-05 16:46:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:04,192 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 821 transitions. [2025-02-05 16:46:04,192 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-02-05 16:46:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 821 transitions. [2025-02-05 16:46:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:04,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:04,193 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-02-05 16:46:04,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 16:46:04,193 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:04,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 111700676, now seen corresponding path program 1 times [2025-02-05 16:46:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062380884] [2025-02-05 16:46:04,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:04,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:04,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:04,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:04,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:04,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062380884] [2025-02-05 16:46:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062380884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:04,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114290684] [2025-02-05 16:46:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:04,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:04,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:04,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:04,364 INFO L87 Difference]: Start difference. First operand 642 states and 821 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-02-05 16:46:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:05,142 INFO L93 Difference]: Finished difference Result 1007 states and 1293 transitions. [2025-02-05 16:46:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:05,142 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-02-05 16:46:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:05,143 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 16:46:05,143 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:05,144 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-02-05 16:46:05,144 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 3988 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3988 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:05,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3988 Valid, 2272 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3225806451612903) internal successors, (820), 641 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 820 transitions. [2025-02-05 16:46:05,149 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 820 transitions. Word has length 96 [2025-02-05 16:46:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:05,149 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 820 transitions. [2025-02-05 16:46:05,149 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-02-05 16:46:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 820 transitions. [2025-02-05 16:46:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:05,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:05,150 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-02-05 16:46:05,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 16:46:05,150 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-02-05 16:46:05,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:05,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2021814712, now seen corresponding path program 1 times [2025-02-05 16:46:05,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:05,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13850550] [2025-02-05 16:46:05,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:05,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:05,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:05,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13850550] [2025-02-05 16:46:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13850550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375286764] [2025-02-05 16:46:05,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:05,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:05,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:05,317 INFO L87 Difference]: Start difference. First operand 642 states and 820 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-02-05 16:46:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:06,097 INFO L93 Difference]: Finished difference Result 936 states and 1184 transitions. [2025-02-05 16:46:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:06,097 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-02-05 16:46:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:06,098 INFO L225 Difference]: With dead ends: 936 [2025-02-05 16:46:06,098 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:06,099 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-02-05 16:46:06,099 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 3565 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3565 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:06,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3565 Valid, 2263 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.320967741935484) internal successors, (819), 641 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 819 transitions. [2025-02-05 16:46:06,105 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 819 transitions. Word has length 96 [2025-02-05 16:46:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:06,105 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 819 transitions. [2025-02-05 16:46:06,105 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-02-05 16:46:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 819 transitions. [2025-02-05 16:46:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:06,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:06,106 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-02-05 16:46:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 16:46:06,106 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:06,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash -987746286, now seen corresponding path program 1 times [2025-02-05 16:46:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069810500] [2025-02-05 16:46:06,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:06,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:06,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:06,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:06,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069810500] [2025-02-05 16:46:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069810500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:06,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:06,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094813790] [2025-02-05 16:46:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:06,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:06,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:06,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:06,243 INFO L87 Difference]: Start difference. First operand 642 states and 819 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-02-05 16:46:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:06,895 INFO L93 Difference]: Finished difference Result 1007 states and 1290 transitions. [2025-02-05 16:46:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:06,895 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-02-05 16:46:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:06,897 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 16:46:06,897 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:06,897 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-02-05 16:46:06,897 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 3922 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3922 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:06,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3922 Valid, 2272 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3193548387096774) internal successors, (818), 641 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 818 transitions. [2025-02-05 16:46:06,902 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 818 transitions. Word has length 96 [2025-02-05 16:46:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:06,902 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 818 transitions. [2025-02-05 16:46:06,902 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-02-05 16:46:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 818 transitions. [2025-02-05 16:46:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:06,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:06,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] [2025-02-05 16:46:06,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 16:46:06,903 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:06,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1046235730, now seen corresponding path program 1 times [2025-02-05 16:46:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36383594] [2025-02-05 16:46:06,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:06,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:06,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:06,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:06,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36383594] [2025-02-05 16:46:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36383594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:07,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:07,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727965772] [2025-02-05 16:46:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:07,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:07,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:07,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:07,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:07,080 INFO L87 Difference]: Start difference. First operand 642 states and 818 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-02-05 16:46:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:08,005 INFO L93 Difference]: Finished difference Result 1041 states and 1343 transitions. [2025-02-05 16:46:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:08,005 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-02-05 16:46:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:08,006 INFO L225 Difference]: With dead ends: 1041 [2025-02-05 16:46:08,006 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:46:08,007 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-02-05 16:46:08,007 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 3456 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:08,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 3132 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:46:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:46:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 642. [2025-02-05 16:46:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3177419354838709) internal successors, (817), 641 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 817 transitions. [2025-02-05 16:46:08,012 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 817 transitions. Word has length 96 [2025-02-05 16:46:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:08,012 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 817 transitions. [2025-02-05 16:46:08,012 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-02-05 16:46:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 817 transitions. [2025-02-05 16:46:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:08,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:08,013 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-02-05 16:46:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 16:46:08,013 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:08,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1593684681, now seen corresponding path program 1 times [2025-02-05 16:46:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:08,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738985491] [2025-02-05 16:46:08,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:08,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:08,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:08,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:08,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:08,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:08,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:08,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738985491] [2025-02-05 16:46:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738985491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025430439] [2025-02-05 16:46:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:08,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:08,165 INFO L87 Difference]: Start difference. First operand 642 states and 817 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-02-05 16:46:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:08,878 INFO L93 Difference]: Finished difference Result 1007 states and 1288 transitions. [2025-02-05 16:46:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:08,878 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-02-05 16:46:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:08,880 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 16:46:08,880 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:08,880 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-02-05 16:46:08,881 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 3660 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3660 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:08,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3660 Valid, 2474 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3161290322580645) internal successors, (816), 641 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 816 transitions. [2025-02-05 16:46:08,885 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 816 transitions. Word has length 96 [2025-02-05 16:46:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:08,885 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 816 transitions. [2025-02-05 16:46:08,885 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-02-05 16:46:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 816 transitions. [2025-02-05 16:46:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:08,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:08,886 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-02-05 16:46:08,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 16:46:08,886 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:08,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:08,886 INFO L85 PathProgramCache]: Analyzing trace with hash -834057870, now seen corresponding path program 1 times [2025-02-05 16:46:08,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:08,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847960041] [2025-02-05 16:46:08,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:08,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:08,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:08,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:08,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:09,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847960041] [2025-02-05 16:46:09,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847960041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:09,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:09,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870032970] [2025-02-05 16:46:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:09,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:09,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:09,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:09,025 INFO L87 Difference]: Start difference. First operand 642 states and 816 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-02-05 16:46:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:09,668 INFO L93 Difference]: Finished difference Result 1010 states and 1290 transitions. [2025-02-05 16:46:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:09,669 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-02-05 16:46:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:09,670 INFO L225 Difference]: With dead ends: 1010 [2025-02-05 16:46:09,670 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:09,670 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-02-05 16:46:09,671 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 3333 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:09,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 2277 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.314516129032258) internal successors, (815), 641 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 815 transitions. [2025-02-05 16:46:09,675 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 815 transitions. Word has length 96 [2025-02-05 16:46:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:09,675 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 815 transitions. [2025-02-05 16:46:09,675 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-02-05 16:46:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 815 transitions. [2025-02-05 16:46:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:09,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:09,676 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-02-05 16:46:09,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 16:46:09,676 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:09,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1890013096, now seen corresponding path program 1 times [2025-02-05 16:46:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715892271] [2025-02-05 16:46:09,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:09,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:09,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:09,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:09,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:09,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:09,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715892271] [2025-02-05 16:46:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715892271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792275143] [2025-02-05 16:46:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:09,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:09,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:09,817 INFO L87 Difference]: Start difference. First operand 642 states and 815 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-02-05 16:46:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:10,498 INFO L93 Difference]: Finished difference Result 1010 states and 1288 transitions. [2025-02-05 16:46:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:10,499 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-02-05 16:46:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:10,500 INFO L225 Difference]: With dead ends: 1010 [2025-02-05 16:46:10,500 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:10,501 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-02-05 16:46:10,501 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 2797 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2797 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:10,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2797 Valid, 2519 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3129032258064517) internal successors, (814), 641 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 814 transitions. [2025-02-05 16:46:10,508 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 814 transitions. Word has length 96 [2025-02-05 16:46:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:10,508 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 814 transitions. [2025-02-05 16:46:10,508 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-02-05 16:46:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 814 transitions. [2025-02-05 16:46:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:10,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:10,509 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-02-05 16:46:10,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 16:46:10,510 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:10,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash 693597107, now seen corresponding path program 1 times [2025-02-05 16:46:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135834310] [2025-02-05 16:46:10,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:10,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:10,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:10,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:10,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135834310] [2025-02-05 16:46:10,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135834310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:10,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:10,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:10,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637377536] [2025-02-05 16:46:10,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:10,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:10,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:10,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:10,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:10,675 INFO L87 Difference]: Start difference. First operand 642 states and 814 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-02-05 16:46:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:11,496 INFO L93 Difference]: Finished difference Result 1007 states and 1284 transitions. [2025-02-05 16:46:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:11,496 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-02-05 16:46:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:11,501 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 16:46:11,502 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 16:46:11,502 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-02-05 16:46:11,503 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 3928 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3928 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:11,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3928 Valid, 2288 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 16:46:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 642. [2025-02-05 16:46:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 620 states have (on average 1.3112903225806452) internal successors, (813), 641 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 813 transitions. [2025-02-05 16:46:11,509 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 813 transitions. Word has length 96 [2025-02-05 16:46:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:11,509 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 813 transitions. [2025-02-05 16:46:11,509 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-02-05 16:46:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 813 transitions. [2025-02-05 16:46:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:11,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:11,510 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-02-05 16:46:11,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 16:46:11,510 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash -360139435, now seen corresponding path program 1 times [2025-02-05 16:46:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:11,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337479638] [2025-02-05 16:46:11,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:11,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:11,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:11,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:11,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:11,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:11,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337479638] [2025-02-05 16:46:11,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337479638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:11,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:11,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:46:11,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899900634] [2025-02-05 16:46:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:11,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:46:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:11,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:46:11,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:46:11,773 INFO L87 Difference]: Start difference. First operand 642 states and 813 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-02-05 16:46:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:13,026 INFO L93 Difference]: Finished difference Result 1267 states and 1666 transitions. [2025-02-05 16:46:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:46:13,028 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-02-05 16:46:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:13,029 INFO L225 Difference]: With dead ends: 1267 [2025-02-05 16:46:13,030 INFO L226 Difference]: Without dead ends: 1181 [2025-02-05 16:46:13,030 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-02-05 16:46:13,030 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 6854 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6854 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:13,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6854 Valid, 3355 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:46:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-02-05 16:46:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 646. [2025-02-05 16:46:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3092948717948718) internal successors, (817), 645 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 817 transitions. [2025-02-05 16:46:13,035 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 817 transitions. Word has length 96 [2025-02-05 16:46:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:13,036 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 817 transitions. [2025-02-05 16:46:13,036 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-02-05 16:46:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2025-02-05 16:46:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:13,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:13,037 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-02-05 16:46:13,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-05 16:46:13,037 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-02-05 16:46:13,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:13,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1402498976, now seen corresponding path program 1 times [2025-02-05 16:46:13,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:13,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211887559] [2025-02-05 16:46:13,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:13,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:13,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:13,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:13,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211887559] [2025-02-05 16:46:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211887559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:13,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117450154] [2025-02-05 16:46:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:13,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:13,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:13,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:13,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:13,219 INFO L87 Difference]: Start difference. First operand 646 states and 817 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-02-05 16:46:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:13,878 INFO L93 Difference]: Finished difference Result 1011 states and 1287 transitions. [2025-02-05 16:46:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:13,879 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-02-05 16:46:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:13,880 INFO L225 Difference]: With dead ends: 1011 [2025-02-05 16:46:13,880 INFO L226 Difference]: Without dead ends: 935 [2025-02-05 16:46:13,880 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-02-05 16:46:13,880 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 2792 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:13,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 2491 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-05 16:46:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 646. [2025-02-05 16:46:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3076923076923077) internal successors, (816), 645 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 816 transitions. [2025-02-05 16:46:13,885 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 816 transitions. Word has length 96 [2025-02-05 16:46:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:13,885 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 816 transitions. [2025-02-05 16:46:13,885 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-02-05 16:46:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 816 transitions. [2025-02-05 16:46:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:13,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:13,885 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-02-05 16:46:13,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-05 16:46:13,885 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:13,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:13,886 INFO L85 PathProgramCache]: Analyzing trace with hash 870586389, now seen corresponding path program 1 times [2025-02-05 16:46:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223646147] [2025-02-05 16:46:13,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:13,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:13,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:13,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:13,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:14,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:14,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223646147] [2025-02-05 16:46:14,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223646147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:14,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:14,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:46:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734969996] [2025-02-05 16:46:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:14,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:46:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:14,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:46:14,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:46:14,152 INFO L87 Difference]: Start difference. First operand 646 states and 816 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-02-05 16:46:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:15,421 INFO L93 Difference]: Finished difference Result 1122 states and 1443 transitions. [2025-02-05 16:46:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:46:15,421 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-02-05 16:46:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:15,422 INFO L225 Difference]: With dead ends: 1122 [2025-02-05 16:46:15,422 INFO L226 Difference]: Without dead ends: 1117 [2025-02-05 16:46:15,423 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-02-05 16:46:15,426 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 7047 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7047 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:15,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7047 Valid, 2891 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:46:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-02-05 16:46:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 650. [2025-02-05 16:46:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.305732484076433) internal successors, (820), 649 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 820 transitions. [2025-02-05 16:46:15,432 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 820 transitions. Word has length 96 [2025-02-05 16:46:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:15,432 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 820 transitions. [2025-02-05 16:46:15,432 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-02-05 16:46:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 820 transitions. [2025-02-05 16:46:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:15,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:15,432 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-02-05 16:46:15,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-05 16:46:15,433 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:15,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1475862785, now seen corresponding path program 1 times [2025-02-05 16:46:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204607085] [2025-02-05 16:46:15,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:15,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:15,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:15,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204607085] [2025-02-05 16:46:15,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204607085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348438747] [2025-02-05 16:46:15,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:15,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:15,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:15,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:15,606 INFO L87 Difference]: Start difference. First operand 650 states and 820 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-02-05 16:46:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:16,443 INFO L93 Difference]: Finished difference Result 1011 states and 1284 transitions. [2025-02-05 16:46:16,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:16,444 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-02-05 16:46:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:16,445 INFO L225 Difference]: With dead ends: 1011 [2025-02-05 16:46:16,445 INFO L226 Difference]: Without dead ends: 935 [2025-02-05 16:46:16,445 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-02-05 16:46:16,445 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 3640 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3640 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:16,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3640 Valid, 2482 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-05 16:46:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 650. [2025-02-05 16:46:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3041401273885351) internal successors, (819), 649 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 819 transitions. [2025-02-05 16:46:16,460 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 819 transitions. Word has length 96 [2025-02-05 16:46:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:16,460 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 819 transitions. [2025-02-05 16:46:16,460 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-02-05 16:46:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 819 transitions. [2025-02-05 16:46:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:16,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:16,461 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-02-05 16:46:16,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-05 16:46:16,461 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:16,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 99877740, now seen corresponding path program 1 times [2025-02-05 16:46:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:16,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314039760] [2025-02-05 16:46:16,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:16,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:16,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:16,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:16,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:16,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314039760] [2025-02-05 16:46:16,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314039760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:16,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:16,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687914572] [2025-02-05 16:46:16,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:16,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:16,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:16,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:16,662 INFO L87 Difference]: Start difference. First operand 650 states and 819 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-02-05 16:46:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:17,495 INFO L93 Difference]: Finished difference Result 1011 states and 1283 transitions. [2025-02-05 16:46:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:17,495 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-02-05 16:46:17,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:17,496 INFO L225 Difference]: With dead ends: 1011 [2025-02-05 16:46:17,496 INFO L226 Difference]: Without dead ends: 935 [2025-02-05 16:46:17,497 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-02-05 16:46:17,497 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1904 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 2467 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:17,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 2467 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-02-05 16:46:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 650. [2025-02-05 16:46:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.302547770700637) internal successors, (818), 649 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 818 transitions. [2025-02-05 16:46:17,511 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 818 transitions. Word has length 96 [2025-02-05 16:46:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:17,514 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 818 transitions. [2025-02-05 16:46:17,514 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-02-05 16:46:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 818 transitions. [2025-02-05 16:46:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:46:17,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:17,515 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-02-05 16:46:17,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-05 16:46:17,515 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:17,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2128461127, now seen corresponding path program 1 times [2025-02-05 16:46:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887806074] [2025-02-05 16:46:17,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:17,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:46:17,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:46:17,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:17,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887806074] [2025-02-05 16:46:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887806074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:17,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:17,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:46:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204728564] [2025-02-05 16:46:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:46:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:17,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:46:17,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:46:17,867 INFO L87 Difference]: Start difference. First operand 650 states and 818 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-02-05 16:46:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:19,112 INFO L93 Difference]: Finished difference Result 1193 states and 1547 transitions. [2025-02-05 16:46:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:46:19,112 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-02-05 16:46:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:19,113 INFO L225 Difference]: With dead ends: 1193 [2025-02-05 16:46:19,113 INFO L226 Difference]: Without dead ends: 1117 [2025-02-05 16:46:19,113 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-02-05 16:46:19,113 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 7044 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7044 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:19,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7044 Valid, 2887 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:46:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-02-05 16:46:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 654. [2025-02-05 16:46:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 632 states have (on average 1.3006329113924051) internal successors, (822), 653 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 822 transitions. [2025-02-05 16:46:19,118 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 822 transitions. Word has length 96 [2025-02-05 16:46:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:19,118 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 822 transitions. [2025-02-05 16:46:19,118 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-02-05 16:46:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 822 transitions. [2025-02-05 16:46:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:19,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:19,119 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-02-05 16:46:19,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-05 16:46:19,119 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2050996807, now seen corresponding path program 1 times [2025-02-05 16:46:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071989370] [2025-02-05 16:46:19,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:19,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:19,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:19,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:19,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:19,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071989370] [2025-02-05 16:46:19,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071989370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:19,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:19,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:19,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72345081] [2025-02-05 16:46:19,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:19,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:19,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:19,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:19,251 INFO L87 Difference]: Start difference. First operand 654 states and 822 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-02-05 16:46:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:19,901 INFO L93 Difference]: Finished difference Result 1066 states and 1356 transitions. [2025-02-05 16:46:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:19,901 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-02-05 16:46:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:19,902 INFO L225 Difference]: With dead ends: 1066 [2025-02-05 16:46:19,902 INFO L226 Difference]: Without dead ends: 975 [2025-02-05 16:46:19,903 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-02-05 16:46:19,903 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 2752 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 2640 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-02-05 16:46:19,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 2640 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:46:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-02-05 16:46:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 650. [2025-02-05 16:46:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 628 states have (on average 1.3009554140127388) internal successors, (817), 649 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 817 transitions. [2025-02-05 16:46:19,907 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 817 transitions. Word has length 97 [2025-02-05 16:46:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:19,907 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 817 transitions. [2025-02-05 16:46:19,908 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-02-05 16:46:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 817 transitions. [2025-02-05 16:46:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:19,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:19,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] [2025-02-05 16:46:19,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-05 16:46:19,909 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:19,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2144208921, now seen corresponding path program 1 times [2025-02-05 16:46:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523899624] [2025-02-05 16:46:19,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:19,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:19,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:19,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:19,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:20,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523899624] [2025-02-05 16:46:20,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523899624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:20,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:20,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602596935] [2025-02-05 16:46:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:20,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:20,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:20,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:20,089 INFO L87 Difference]: Start difference. First operand 650 states and 817 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-02-05 16:46:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:20,881 INFO L93 Difference]: Finished difference Result 1005 states and 1273 transitions. [2025-02-05 16:46:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:20,881 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-02-05 16:46:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:20,882 INFO L225 Difference]: With dead ends: 1005 [2025-02-05 16:46:20,882 INFO L226 Difference]: Without dead ends: 930 [2025-02-05 16:46:20,882 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-02-05 16:46:20,883 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 3864 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3864 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:20,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3864 Valid, 2324 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-05 16:46:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 649. [2025-02-05 16:46:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 627 states have (on average 1.2998405103668262) internal successors, (815), 648 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 815 transitions. [2025-02-05 16:46:20,887 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 815 transitions. Word has length 97 [2025-02-05 16:46:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:20,888 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 815 transitions. [2025-02-05 16:46:20,888 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-02-05 16:46:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 815 transitions. [2025-02-05 16:46:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:20,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:20,888 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-02-05 16:46:20,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-05 16:46:20,889 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:20,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash 476420196, now seen corresponding path program 1 times [2025-02-05 16:46:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189862209] [2025-02-05 16:46:20,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:20,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:20,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:20,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189862209] [2025-02-05 16:46:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189862209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:21,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178029310] [2025-02-05 16:46:21,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:21,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:21,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:21,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:21,039 INFO L87 Difference]: Start difference. First operand 649 states and 815 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-02-05 16:46:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:21,811 INFO L93 Difference]: Finished difference Result 1004 states and 1271 transitions. [2025-02-05 16:46:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:21,811 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-02-05 16:46:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:21,812 INFO L225 Difference]: With dead ends: 1004 [2025-02-05 16:46:21,812 INFO L226 Difference]: Without dead ends: 930 [2025-02-05 16:46:21,813 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-02-05 16:46:21,813 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2907 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:21,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2907 Valid, 2324 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-05 16:46:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 649. [2025-02-05 16:46:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 627 states have (on average 1.2982456140350878) internal successors, (814), 648 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 814 transitions. [2025-02-05 16:46:21,817 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 814 transitions. Word has length 97 [2025-02-05 16:46:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:21,818 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 814 transitions. [2025-02-05 16:46:21,818 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-02-05 16:46:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 814 transitions. [2025-02-05 16:46:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:21,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:21,818 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-02-05 16:46:21,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-05 16:46:21,819 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:21,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 595347058, now seen corresponding path program 1 times [2025-02-05 16:46:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:21,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054959377] [2025-02-05 16:46:21,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:21,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:21,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:21,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:21,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:21,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054959377] [2025-02-05 16:46:21,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054959377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:21,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:21,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054463619] [2025-02-05 16:46:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:21,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:21,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:21,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:21,972 INFO L87 Difference]: Start difference. First operand 649 states and 814 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-02-05 16:46:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:22,739 INFO L93 Difference]: Finished difference Result 1060 states and 1347 transitions. [2025-02-05 16:46:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:22,739 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-02-05 16:46:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:22,740 INFO L225 Difference]: With dead ends: 1060 [2025-02-05 16:46:22,740 INFO L226 Difference]: Without dead ends: 974 [2025-02-05 16:46:22,741 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-02-05 16:46:22,741 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1819 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:22,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 2676 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-02-05 16:46:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 645. [2025-02-05 16:46:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.2985553772070626) internal successors, (809), 644 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 809 transitions. [2025-02-05 16:46:22,746 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 809 transitions. Word has length 97 [2025-02-05 16:46:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:22,746 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 809 transitions. [2025-02-05 16:46:22,746 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-02-05 16:46:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 809 transitions. [2025-02-05 16:46:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:22,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:22,747 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-02-05 16:46:22,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-05 16:46:22,747 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:22,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1786415568, now seen corresponding path program 1 times [2025-02-05 16:46:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130640751] [2025-02-05 16:46:22,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:22,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:22,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:22,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:22,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130640751] [2025-02-05 16:46:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130640751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:22,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:22,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893805093] [2025-02-05 16:46:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:22,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:22,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:22,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:22,928 INFO L87 Difference]: Start difference. First operand 645 states and 809 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-02-05 16:46:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:23,728 INFO L93 Difference]: Finished difference Result 931 states and 1159 transitions. [2025-02-05 16:46:23,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:23,728 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-02-05 16:46:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:23,729 INFO L225 Difference]: With dead ends: 931 [2025-02-05 16:46:23,729 INFO L226 Difference]: Without dead ends: 926 [2025-02-05 16:46:23,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:46:23,730 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 3791 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:23,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3791 Valid, 2361 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-02-05 16:46:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 641. [2025-02-05 16:46:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 619 states have (on average 1.2988691437802908) internal successors, (804), 640 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 804 transitions. [2025-02-05 16:46:23,735 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 804 transitions. Word has length 97 [2025-02-05 16:46:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:23,735 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 804 transitions. [2025-02-05 16:46:23,735 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-02-05 16:46:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 804 transitions. [2025-02-05 16:46:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:23,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:23,736 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-02-05 16:46:23,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-05 16:46:23,736 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1769840326, now seen corresponding path program 1 times [2025-02-05 16:46:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:23,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583685796] [2025-02-05 16:46:23,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:23,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:23,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:23,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:23,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:23,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-02-05 16:46:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583685796] [2025-02-05 16:46:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583685796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462119770] [2025-02-05 16:46:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:23,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:23,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:23,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:23,958 INFO L87 Difference]: Start difference. First operand 641 states and 804 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-02-05 16:46:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:24,718 INFO L93 Difference]: Finished difference Result 1000 states and 1264 transitions. [2025-02-05 16:46:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:24,719 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-02-05 16:46:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:24,720 INFO L225 Difference]: With dead ends: 1000 [2025-02-05 16:46:24,720 INFO L226 Difference]: Without dead ends: 925 [2025-02-05 16:46:24,720 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-02-05 16:46:24,721 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 3460 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3460 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:24,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3460 Valid, 2622 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-02-05 16:46:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 640. [2025-02-05 16:46:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 618 states have (on average 1.2977346278317152) internal successors, (802), 639 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 802 transitions. [2025-02-05 16:46:24,735 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 802 transitions. Word has length 97 [2025-02-05 16:46:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:24,735 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 802 transitions. [2025-02-05 16:46:24,736 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-02-05 16:46:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 802 transitions. [2025-02-05 16:46:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:24,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:24,737 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-02-05 16:46:24,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-05 16:46:24,737 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:24,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2111857312, now seen corresponding path program 1 times [2025-02-05 16:46:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027208597] [2025-02-05 16:46:24,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:24,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:24,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:24,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:24,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:24,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:24,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027208597] [2025-02-05 16:46:24,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027208597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:24,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:24,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:46:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345889113] [2025-02-05 16:46:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:24,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:46:24,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:24,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:46:24,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:46:24,980 INFO L87 Difference]: Start difference. First operand 640 states and 802 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-02-05 16:46:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:26,189 INFO L93 Difference]: Finished difference Result 1181 states and 1528 transitions. [2025-02-05 16:46:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:46:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-02-05 16:46:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:26,190 INFO L225 Difference]: With dead ends: 1181 [2025-02-05 16:46:26,190 INFO L226 Difference]: Without dead ends: 1106 [2025-02-05 16:46:26,191 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-02-05 16:46:26,191 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 6837 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6837 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:26,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6837 Valid, 2983 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:46:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-02-05 16:46:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 644. [2025-02-05 16:46:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.2958199356913183) internal successors, (806), 643 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 806 transitions. [2025-02-05 16:46:26,202 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 806 transitions. Word has length 97 [2025-02-05 16:46:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:26,202 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 806 transitions. [2025-02-05 16:46:26,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 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-02-05 16:46:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 806 transitions. [2025-02-05 16:46:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:26,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:26,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:26,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-05 16:46:26,203 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:26,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:26,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1135289249, now seen corresponding path program 1 times [2025-02-05 16:46:26,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:26,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733597843] [2025-02-05 16:46:26,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:26,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:26,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:26,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:26,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:26,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-02-05 16:46:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733597843] [2025-02-05 16:46:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733597843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:26,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651890212] [2025-02-05 16:46:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:26,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:26,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:26,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:26,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:26,368 INFO L87 Difference]: Start difference. First operand 644 states and 806 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-02-05 16:46:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:27,147 INFO L93 Difference]: Finished difference Result 999 states and 1261 transitions. [2025-02-05 16:46:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:27,147 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-02-05 16:46:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:27,148 INFO L225 Difference]: With dead ends: 999 [2025-02-05 16:46:27,148 INFO L226 Difference]: Without dead ends: 924 [2025-02-05 16:46:27,148 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-02-05 16:46:27,148 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 3785 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3785 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:27,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3785 Valid, 2372 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-02-05 16:46:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 644. [2025-02-05 16:46:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.2942122186495177) internal successors, (805), 643 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 805 transitions. [2025-02-05 16:46:27,153 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 805 transitions. Word has length 97 [2025-02-05 16:46:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:27,153 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 805 transitions. [2025-02-05 16:46:27,153 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-02-05 16:46:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 805 transitions. [2025-02-05 16:46:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:27,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:27,154 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-02-05 16:46:27,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-05 16:46:27,154 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:27,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1567241491, now seen corresponding path program 1 times [2025-02-05 16:46:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:27,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003603735] [2025-02-05 16:46:27,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:27,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:27,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-02-05 16:46:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003603735] [2025-02-05 16:46:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003603735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:27,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091955830] [2025-02-05 16:46:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:27,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:27,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:27,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:27,295 INFO L87 Difference]: Start difference. First operand 644 states and 805 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-02-05 16:46:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:28,046 INFO L93 Difference]: Finished difference Result 998 states and 1259 transitions. [2025-02-05 16:46:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:28,046 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-02-05 16:46:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:28,048 INFO L225 Difference]: With dead ends: 998 [2025-02-05 16:46:28,048 INFO L226 Difference]: Without dead ends: 923 [2025-02-05 16:46:28,048 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-02-05 16:46:28,048 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 3718 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3718 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:28,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3718 Valid, 2372 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:46:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-02-05 16:46:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 643. [2025-02-05 16:46:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.2930756843800322) internal successors, (803), 642 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:46:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 803 transitions. [2025-02-05 16:46:28,053 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 803 transitions. Word has length 97 [2025-02-05 16:46:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:28,053 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 803 transitions. [2025-02-05 16:46:28,054 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-02-05 16:46:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 803 transitions. [2025-02-05 16:46:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:46:28,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:28,054 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-02-05 16:46:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-02-05 16:46:28,055 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:46:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 689047034, now seen corresponding path program 1 times [2025-02-05 16:46:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745041792] [2025-02-05 16:46:28,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:28,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:46:28,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:46:28,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:28,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745041792] [2025-02-05 16:46:28,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745041792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:28,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560339207] [2025-02-05 16:46:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:28,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:28,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:28,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:28,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:28,225 INFO L87 Difference]: Start difference. First operand 643 states and 803 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)