./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.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.1.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 bf3e653d470f38ca10e6f2ef710928478301c2e1b39e054d852fd4b90e26a334 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:43:51,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:43:51,787 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:43:51,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:43:51,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:43:51,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:43:51,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:43:51,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:43:51,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:43:51,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:43:51,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:43:51,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:43:51,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:43:51,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:43:51,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:51,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:43:51,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:43:51,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:43:51,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:43:51,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:43:51,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:43:51,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:43:51,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:43:51,816 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 -> bf3e653d470f38ca10e6f2ef710928478301c2e1b39e054d852fd4b90e26a334 [2025-02-05 16:43:52,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:43:52,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:43:52,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:43:52,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:43:52,063 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:43:52,064 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:43:53,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54458e236/aba046bc46704f0587e6381e74facfce/FLAGcfb881d50 [2025-02-05 16:43:53,719 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:43:53,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:43:53,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54458e236/aba046bc46704f0587e6381e74facfce/FLAGcfb881d50 [2025-02-05 16:43:53,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54458e236/aba046bc46704f0587e6381e74facfce [2025-02-05 16:43:53,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:43:53,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:43:53,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:53,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:43:53,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:43:53,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:53" (1/1) ... [2025-02-05 16:43:53,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6626b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:53, skipping insertion in model container [2025-02-05 16:43:53,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:53" (1/1) ... [2025-02-05 16:43:53,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:43:54,322 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69564,69577] [2025-02-05 16:43:54,386 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101232,101245] [2025-02-05 16:43:54,416 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[117050,117063] [2025-02-05 16:43:54,455 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124955,124968] [2025-02-05 16:43:54,470 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128881,128894] [2025-02-05 16:43:54,480 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132623,132636] [2025-02-05 16:43:54,569 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163781,163794] [2025-02-05 16:43:54,621 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[179384,179397] [2025-02-05 16:43:54,635 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[187284,187297] [2025-02-05 16:43:54,642 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[191205,191218] [2025-02-05 16:43:54,649 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194942,194955] [2025-02-05 16:43:54,681 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211727,211740] [2025-02-05 16:43:54,698 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219627,219640] [2025-02-05 16:43:54,705 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223548,223561] [2025-02-05 16:43:54,712 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[227285,227298] [2025-02-05 16:43:54,719 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231785,231798] [2025-02-05 16:43:54,726 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[235573,235586] [2025-02-05 16:43:54,733 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[239494,239507] [2025-02-05 16:43:54,741 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[243231,243244] [2025-02-05 16:43:54,748 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[247352,247365] [2025-02-05 16:43:54,754 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251105,251118] [2025-02-05 16:43:54,761 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[255022,255035] [2025-02-05 16:43:54,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:54,817 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:43:54,963 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[69564,69577] [2025-02-05 16:43:55,058 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101232,101245] [2025-02-05 16:43:55,080 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[117050,117063] [2025-02-05 16:43:55,091 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[124955,124968] [2025-02-05 16:43:55,096 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[128881,128894] [2025-02-05 16:43:55,101 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132623,132636] [2025-02-05 16:43:55,142 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[163781,163794] [2025-02-05 16:43:55,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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[179384,179397] [2025-02-05 16:43:55,172 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[187284,187297] [2025-02-05 16:43:55,177 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[191205,191218] [2025-02-05 16:43:55,182 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[194942,194955] [2025-02-05 16:43:55,202 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[211727,211740] [2025-02-05 16:43:55,211 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[219627,219640] [2025-02-05 16:43:55,216 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[223548,223561] [2025-02-05 16:43:55,221 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[227285,227298] [2025-02-05 16:43:55,226 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231785,231798] [2025-02-05 16:43:55,231 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[235573,235586] [2025-02-05 16:43:55,236 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[239494,239507] [2025-02-05 16:43:55,241 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[243231,243244] [2025-02-05 16:43:55,246 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[247352,247365] [2025-02-05 16:43:55,251 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251105,251118] [2025-02-05 16:43:55,256 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[255022,255035] [2025-02-05 16:43:55,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:55,331 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:43:55,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55 WrapperNode [2025-02-05 16:43:55,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:55,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:55,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:43:55,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:43:55,338 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:43:55" (1/1) ... [2025-02-05 16:43:55,378 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:43:55" (1/1) ... [2025-02-05 16:43:55,629 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12235 [2025-02-05 16:43:55,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:55,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:43:55,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:43:55,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:43:55,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,723 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:43:55,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:43:55,870 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:43:55,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:43:55,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:43:55,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (1/1) ... [2025-02-05 16:43:55,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:43:55,897 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:43:55,899 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:43:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:43:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:43:55,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:43:55,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:43:56,196 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:43:56,198 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:44:00,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14240: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~66#1; [2025-02-05 16:44:00,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10541: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-02-05 16:44:00,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16631: 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:44:00,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20597: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:44:00,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8178: 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:44:00,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15313: 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:44:00,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11614: 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:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7390: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~33#1; [2025-02-05 16:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4226: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~15#1; [2025-02-05 16:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9250: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~35#1; [2025-02-05 16:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13478: 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:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20349: havoc main_~node2__m2~66#1; [2025-02-05 16:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3437: 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:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~3#1; [2025-02-05 16:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18502: 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:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: 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:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10048: 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:44:00,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5029: 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:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6617: 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:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17980: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~63#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20625: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4243: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~18#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19836: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~93#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9267: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~42#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17997: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~70#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11920: 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:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20381: havoc main_~node3__m3~68#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10340: 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:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12983: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~45#1; [2025-02-05 16:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16158: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~75#1; [2025-02-05 16:44:00,548 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:44:00,548 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16953: 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:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20654: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~9#1; [2025-02-05 16:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14842: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~69#1; [2025-02-05 16:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2158: 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:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5329: 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:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18014: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~84#1; [2025-02-05 16:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18810: 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:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8505: 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:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13791: 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:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13000: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~50#1; [2025-02-05 16:44:00,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6923: 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11154: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~51#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~10#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3761: 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:44:00,550 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20413: havoc main_~node4__m4~72#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6144: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~27#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13017: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~60#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7998: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~27#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19102: 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17253: 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~12#1; [2025-02-05 16:44:00,550 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12235: 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15674: 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14091: 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8015: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~30#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9869: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~45#1; [2025-02-05 16:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L885: 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:44:00,550 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8818: 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:44:00,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20445: havoc main_~node5__m5~80#1; [2025-02-05 16:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4856: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~21#1; [2025-02-05 16:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1688: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~5#1; [2025-02-05 16:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2482: 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:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8032: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~36#1; [2025-02-05 16:44:00,551 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:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16763: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~65#1; [2025-02-05 16:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7250: 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:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15443: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~51#1; [2025-02-05 16:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4083: 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:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~6#1; [2025-02-05 16:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5669: 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:44:00,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17561: 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:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10692: 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:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12548: 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:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11757: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~45#1; [2025-02-05 16:44:00,552 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:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19422: 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:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16780: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~78#1; [2025-02-05 16:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18631: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~87#1; [2025-02-05 16:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15460: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~54#1; [2025-02-05 16:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9118: 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:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13618: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~63#1; [2025-02-05 16:44:00,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14413: 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:44:00,552 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11774: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~54#1; [2025-02-05 16:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17853: 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15477: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~60#1; [2025-02-05 16:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~25#1; [2025-02-05 16:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5971: 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10993: 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1216: 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19715: 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4389: 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: 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:44:00,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16018: 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:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7563: 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:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12848: 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:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20513: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~96#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10473: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~33#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15494: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~72#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6777: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~30#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~15#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14713: 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:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5467: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~17#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10490: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~34#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8645: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~39#1; [2025-02-05 16:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9440: 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:44:00,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20541: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-02-05 16:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1517: 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:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20018: 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:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5484: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~18#1; [2025-02-05 16:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7863: 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:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19226: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~75#1; [2025-02-05 16:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10507: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~36#1; [2025-02-05 16:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17382: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~81#1; [2025-02-05 16:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11305: 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:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16331: 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:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13163: 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:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5501: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-02-05 16:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19243: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~90#1; [2025-02-05 16:44:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2331: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~9#1; [2025-02-05 16:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6295: 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:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14223: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~55#1; [2025-02-05 16:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10524: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~40#1; [2025-02-05 16:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12375: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~57#1; [2025-02-05 16:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20569: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-02-05 16:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15021: 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:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20307: 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:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4716: 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:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9740: 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:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3135: 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:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18199: 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:44:00,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5518: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~24#1; [2025-02-05 16:44:01,013 INFO L? ?]: Removed 2222 outVars from TransFormulas that were not future-live. [2025-02-05 16:44:01,013 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:44:01,069 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:44:01,069 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:44:01,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:44:01 BoogieIcfgContainer [2025-02-05 16:44:01,069 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:44:01,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:44:01,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:44:01,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:44:01,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:43:53" (1/3) ... [2025-02-05 16:44:01,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230b225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:44:01, skipping insertion in model container [2025-02-05 16:44:01,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:55" (2/3) ... [2025-02-05 16:44:01,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230b225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:44:01, skipping insertion in model container [2025-02-05 16:44:01,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:44:01" (3/3) ... [2025-02-05 16:44:01,080 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:44:01,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:44:01,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.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:44:01,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:44:01,190 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;@74e0c8c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:44:01,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-05 16:44:01,200 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:44:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:44:01,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:01,222 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:44:01,223 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:44:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1381768955, now seen corresponding path program 1 times [2025-02-05 16:44:01,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137841333] [2025-02-05 16:44:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:01,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:44:01,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:44:01,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:01,930 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:44:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137841333] [2025-02-05 16:44:01,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137841333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:01,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:01,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:01,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155721177] [2025-02-05 16:44:01,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:01,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:01,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:01,988 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:44:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:03,470 INFO L93 Difference]: Finished difference Result 2676 states and 4754 transitions. [2025-02-05 16:44:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:03,472 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:44:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:03,482 INFO L225 Difference]: With dead ends: 2676 [2025-02-05 16:44:03,482 INFO L226 Difference]: Without dead ends: 1505 [2025-02-05 16:44:03,486 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:44:03,488 INFO L435 NwaCegarLoop]: 1447 mSDtfsCounter, 7827 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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:44:03,488 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:44:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-02-05 16:44:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-02-05 16:44:03,541 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:44:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1950 transitions. [2025-02-05 16:44:03,546 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1950 transitions. Word has length 86 [2025-02-05 16:44:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1950 transitions. [2025-02-05 16:44:03,547 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:44:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1950 transitions. [2025-02-05 16:44:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:44:03,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:03,550 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:44:03,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:44:03,550 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:44:03,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1923461938, now seen corresponding path program 1 times [2025-02-05 16:44:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155810222] [2025-02-05 16:44:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:44:03,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:44:03,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:03,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:03,699 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:44:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155810222] [2025-02-05 16:44:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155810222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510352159] [2025-02-05 16:44:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:03,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:03,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:03,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:03,701 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:44:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:04,836 INFO L93 Difference]: Finished difference Result 2606 states and 3431 transitions. [2025-02-05 16:44:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:04,837 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:44:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:04,843 INFO L225 Difference]: With dead ends: 2606 [2025-02-05 16:44:04,843 INFO L226 Difference]: Without dead ends: 1831 [2025-02-05 16:44:04,844 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:44:04,845 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 6460 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6460 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:04,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6460 Valid, 1152 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:44:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-02-05 16:44:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1715. [2025-02-05 16:44:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1693 states have (on average 1.3756645008860011) internal successors, (2329), 1714 states have internal predecessors, (2329), 0 states have call successors, (0), 0 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:44:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2329 transitions. [2025-02-05 16:44:04,881 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2329 transitions. Word has length 86 [2025-02-05 16:44:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:04,882 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2329 transitions. [2025-02-05 16:44:04,882 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:44:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2329 transitions. [2025-02-05 16:44:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:44:04,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:04,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] [2025-02-05 16:44:04,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:44:04,885 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:44:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1542236023, now seen corresponding path program 1 times [2025-02-05 16:44:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991129567] [2025-02-05 16:44:04,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:04,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:44:04,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:44:04,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:04,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:05,089 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:44:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:05,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991129567] [2025-02-05 16:44:05,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991129567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:05,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:05,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258260925] [2025-02-05 16:44:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:05,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:05,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:05,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:05,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:05,090 INFO L87 Difference]: Start difference. First operand 1715 states and 2329 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:44:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:05,850 INFO L93 Difference]: Finished difference Result 2354 states and 3209 transitions. [2025-02-05 16:44:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:05,850 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:44:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:05,855 INFO L225 Difference]: With dead ends: 2354 [2025-02-05 16:44:05,855 INFO L226 Difference]: Without dead ends: 1651 [2025-02-05 16:44:05,856 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:44:05,857 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4627 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4627 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:05,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4627 Valid, 697 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-02-05 16:44:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2025-02-05 16:44:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1629 states have (on average 1.3842848373235113) internal successors, (2255), 1650 states have internal predecessors, (2255), 0 states have call successors, (0), 0 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:44:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2255 transitions. [2025-02-05 16:44:05,882 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2255 transitions. Word has length 86 [2025-02-05 16:44:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:05,882 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2255 transitions. [2025-02-05 16:44:05,882 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:44:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2255 transitions. [2025-02-05 16:44:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:44:05,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:05,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] [2025-02-05 16:44:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:44:05,885 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:44:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash -209085593, now seen corresponding path program 1 times [2025-02-05 16:44:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216507259] [2025-02-05 16:44:05,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:05,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:44:05,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:44:05,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:05,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:06,158 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:44:06,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:06,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216507259] [2025-02-05 16:44:06,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216507259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:06,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:06,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492794042] [2025-02-05 16:44:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:06,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:06,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:06,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:06,159 INFO L87 Difference]: Start difference. First operand 1651 states and 2255 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:44:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:06,689 INFO L93 Difference]: Finished difference Result 2220 states and 3036 transitions. [2025-02-05 16:44:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:06,689 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:44:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:06,694 INFO L225 Difference]: With dead ends: 2220 [2025-02-05 16:44:06,694 INFO L226 Difference]: Without dead ends: 1361 [2025-02-05 16:44:06,695 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:44:06,696 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 3839 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3839 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:06,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3839 Valid, 647 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:44:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-02-05 16:44:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1361. [2025-02-05 16:44:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1339 states have (on average 1.4002987303958179) internal successors, (1875), 1360 states have internal predecessors, (1875), 0 states have call successors, (0), 0 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:44:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1875 transitions. [2025-02-05 16:44:06,723 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1875 transitions. Word has length 87 [2025-02-05 16:44:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1875 transitions. [2025-02-05 16:44:06,723 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:44:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1875 transitions. [2025-02-05 16:44:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:44:06,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:06,728 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:44:06,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:44:06,728 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:44:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -954259636, now seen corresponding path program 1 times [2025-02-05 16:44:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:06,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942045569] [2025-02-05 16:44:06,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:44:06,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:44:06,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:06,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:06,886 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:44:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942045569] [2025-02-05 16:44:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942045569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119689752] [2025-02-05 16:44:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:06,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:06,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:06,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:06,889 INFO L87 Difference]: Start difference. First operand 1361 states and 1875 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:44:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:07,343 INFO L93 Difference]: Finished difference Result 1646 states and 2232 transitions. [2025-02-05 16:44:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:07,344 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:44:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:07,348 INFO L225 Difference]: With dead ends: 1646 [2025-02-05 16:44:07,348 INFO L226 Difference]: Without dead ends: 961 [2025-02-05 16:44:07,349 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:44:07,350 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 2612 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:07,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 491 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-02-05 16:44:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-02-05 16:44:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 939 states have (on average 1.410010649627263) internal successors, (1324), 960 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:44:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1324 transitions. [2025-02-05 16:44:07,364 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1324 transitions. Word has length 88 [2025-02-05 16:44:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:07,365 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1324 transitions. [2025-02-05 16:44:07,365 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:44:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1324 transitions. [2025-02-05 16:44:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:44:07,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:07,367 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:44:07,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:44:07,367 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:44:07,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -283355437, now seen corresponding path program 1 times [2025-02-05 16:44:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794971228] [2025-02-05 16:44:07,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:07,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:44:07,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:44:07,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:07,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:07,510 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:44:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794971228] [2025-02-05 16:44:07,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794971228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:07,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:07,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:07,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209549549] [2025-02-05 16:44:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:07,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:07,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:07,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:07,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:07,511 INFO L87 Difference]: Start difference. First operand 961 states and 1324 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:44:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:07,807 INFO L93 Difference]: Finished difference Result 1449 states and 2005 transitions. [2025-02-05 16:44:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:07,808 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:44:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:07,810 INFO L225 Difference]: With dead ends: 1449 [2025-02-05 16:44:07,810 INFO L226 Difference]: Without dead ends: 905 [2025-02-05 16:44:07,811 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:44:07,811 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2493 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:07,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2493 Valid, 488 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-02-05 16:44:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2025-02-05 16:44:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.4190260475651189) internal successors, (1253), 904 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1253 transitions. [2025-02-05 16:44:07,821 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1253 transitions. Word has length 89 [2025-02-05 16:44:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:07,821 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1253 transitions. [2025-02-05 16:44:07,821 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:44:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1253 transitions. [2025-02-05 16:44:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:44:07,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:07,823 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:44:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:44:07,823 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:44:07,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1636391385, now seen corresponding path program 1 times [2025-02-05 16:44:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:07,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723738859] [2025-02-05 16:44:07,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:07,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:07,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:44:07,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:44:07,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:07,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:08,255 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:44:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723738859] [2025-02-05 16:44:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723738859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:44:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961408633] [2025-02-05 16:44:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:08,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:44:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:08,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:44:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:44:08,258 INFO L87 Difference]: Start difference. First operand 905 states and 1253 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:44:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:09,078 INFO L93 Difference]: Finished difference Result 1644 states and 2218 transitions. [2025-02-05 16:44:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:44:09,078 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:44:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:09,081 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 16:44:09,081 INFO L226 Difference]: Without dead ends: 1226 [2025-02-05 16:44:09,082 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:44:09,083 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 3457 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3457 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:09,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3457 Valid, 1726 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-02-05 16:44:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 905. [2025-02-05 16:44:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.4178935447338619) internal successors, (1252), 904 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1252 transitions. [2025-02-05 16:44:09,095 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1252 transitions. Word has length 90 [2025-02-05 16:44:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:09,095 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1252 transitions. [2025-02-05 16:44:09,095 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:44:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1252 transitions. [2025-02-05 16:44:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:44:09,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:09,097 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:44:09,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:44:09,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:09,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1435763157, now seen corresponding path program 1 times [2025-02-05 16:44:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:09,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119524725] [2025-02-05 16:44:09,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:09,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:44:09,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:44:09,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:09,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119524725] [2025-02-05 16:44:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119524725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:09,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:09,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236859305] [2025-02-05 16:44:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:09,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:09,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:09,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:09,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:09,425 INFO L87 Difference]: Start difference. First operand 905 states and 1252 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:44:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:10,369 INFO L93 Difference]: Finished difference Result 1247 states and 1748 transitions. [2025-02-05 16:44:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:10,369 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:44:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:10,372 INFO L225 Difference]: With dead ends: 1247 [2025-02-05 16:44:10,372 INFO L226 Difference]: Without dead ends: 983 [2025-02-05 16:44:10,372 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:44:10,373 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2371 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:10,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 2820 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-02-05 16:44:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 905. [2025-02-05 16:44:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.4167610419026047) internal successors, (1251), 904 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1251 transitions. [2025-02-05 16:44:10,387 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1251 transitions. Word has length 90 [2025-02-05 16:44:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:10,387 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1251 transitions. [2025-02-05 16:44:10,388 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:44:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1251 transitions. [2025-02-05 16:44:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:44:10,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:10,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:44:10,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1149666633, now seen corresponding path program 1 times [2025-02-05 16:44:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037789848] [2025-02-05 16:44:10,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:10,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:44:10,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:44:10,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:10,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:10,724 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:44:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037789848] [2025-02-05 16:44:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037789848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543224609] [2025-02-05 16:44:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:10,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:10,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:10,726 INFO L87 Difference]: Start difference. First operand 905 states and 1251 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:44:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:11,713 INFO L93 Difference]: Finished difference Result 1626 states and 2276 transitions. [2025-02-05 16:44:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:11,714 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:44:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:11,717 INFO L225 Difference]: With dead ends: 1626 [2025-02-05 16:44:11,717 INFO L226 Difference]: Without dead ends: 1430 [2025-02-05 16:44:11,718 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:44:11,719 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 4333 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4333 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:11,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4333 Valid, 2450 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-02-05 16:44:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 905. [2025-02-05 16:44:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.4156285390713477) internal successors, (1250), 904 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1250 transitions. [2025-02-05 16:44:11,735 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1250 transitions. Word has length 90 [2025-02-05 16:44:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:11,736 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1250 transitions. [2025-02-05 16:44:11,736 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:44:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1250 transitions. [2025-02-05 16:44:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:11,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:11,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] [2025-02-05 16:44:11,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:44:11,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:11,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1567686024, now seen corresponding path program 1 times [2025-02-05 16:44:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28275198] [2025-02-05 16:44:11,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:11,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:11,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:11,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:11,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:11,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:11,954 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:44:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:11,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28275198] [2025-02-05 16:44:11,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28275198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:11,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:11,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:11,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972486163] [2025-02-05 16:44:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:11,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:11,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:11,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:11,956 INFO L87 Difference]: Start difference. First operand 905 states and 1250 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:44:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:12,692 INFO L93 Difference]: Finished difference Result 1383 states and 1930 transitions. [2025-02-05 16:44:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:12,692 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:44:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:12,694 INFO L225 Difference]: With dead ends: 1383 [2025-02-05 16:44:12,695 INFO L226 Difference]: Without dead ends: 983 [2025-02-05 16:44:12,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:44:12,696 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 2442 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2442 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:12,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2442 Valid, 2081 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:44:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-02-05 16:44:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 905. [2025-02-05 16:44:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.4133635334088335) internal successors, (1248), 904 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1248 transitions. [2025-02-05 16:44:12,706 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1248 transitions. Word has length 92 [2025-02-05 16:44:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:12,706 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1248 transitions. [2025-02-05 16:44:12,706 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:44:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1248 transitions. [2025-02-05 16:44:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:12,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:12,707 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:44:12,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:44:12,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:12,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash 873540977, now seen corresponding path program 1 times [2025-02-05 16:44:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:12,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875935328] [2025-02-05 16:44:12,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:12,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:12,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:12,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:12,950 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:44:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875935328] [2025-02-05 16:44:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875935328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716816191] [2025-02-05 16:44:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:12,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:12,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:12,953 INFO L87 Difference]: Start difference. First operand 905 states and 1248 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:44:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:14,000 INFO L93 Difference]: Finished difference Result 1674 states and 2336 transitions. [2025-02-05 16:44:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:14,001 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:44:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:14,004 INFO L225 Difference]: With dead ends: 1674 [2025-02-05 16:44:14,004 INFO L226 Difference]: Without dead ends: 1430 [2025-02-05 16:44:14,005 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:44:14,005 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 3472 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3472 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:14,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3472 Valid, 3092 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:44:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-02-05 16:44:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 905. [2025-02-05 16:44:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.4110985277463193) internal successors, (1246), 904 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1246 transitions. [2025-02-05 16:44:14,016 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1246 transitions. Word has length 92 [2025-02-05 16:44:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:14,016 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1246 transitions. [2025-02-05 16:44:14,017 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:44:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1246 transitions. [2025-02-05 16:44:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:14,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:14,018 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:44:14,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:44:14,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:14,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash 519089657, now seen corresponding path program 1 times [2025-02-05 16:44:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953952509] [2025-02-05 16:44:14,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:14,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:14,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:14,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:14,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:14,251 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:44:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953952509] [2025-02-05 16:44:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953952509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632201530] [2025-02-05 16:44:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:14,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:14,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:14,253 INFO L87 Difference]: Start difference. First operand 905 states and 1246 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:44:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:15,456 INFO L93 Difference]: Finished difference Result 1593 states and 2216 transitions. [2025-02-05 16:44:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:15,457 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:44:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:15,460 INFO L225 Difference]: With dead ends: 1593 [2025-02-05 16:44:15,460 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:15,460 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:44:15,461 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 2891 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:15,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 2897 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:44:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 905. [2025-02-05 16:44:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.4088335220838053) internal successors, (1244), 904 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:44:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1244 transitions. [2025-02-05 16:44:15,471 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1244 transitions. Word has length 92 [2025-02-05 16:44:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:15,472 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1244 transitions. [2025-02-05 16:44:15,472 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:44:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1244 transitions. [2025-02-05 16:44:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:15,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:15,473 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:44:15,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:44:15,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:15,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash -565292661, now seen corresponding path program 1 times [2025-02-05 16:44:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:15,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357987342] [2025-02-05 16:44:15,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:15,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:15,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:15,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:15,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:15,686 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:44:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357987342] [2025-02-05 16:44:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357987342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:15,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:15,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354481894] [2025-02-05 16:44:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:15,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:15,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:15,688 INFO L87 Difference]: Start difference. First operand 905 states and 1244 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:44:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:16,676 INFO L93 Difference]: Finished difference Result 1640 states and 2283 transitions. [2025-02-05 16:44:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:16,676 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:44:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:16,679 INFO L225 Difference]: With dead ends: 1640 [2025-02-05 16:44:16,679 INFO L226 Difference]: Without dead ends: 1430 [2025-02-05 16:44:16,680 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:44:16,681 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 3385 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3385 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:16,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3385 Valid, 3099 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:44:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-02-05 16:44:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 905. [2025-02-05 16:44:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.407701019252548) internal successors, (1243), 904 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1243 transitions. [2025-02-05 16:44:16,692 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1243 transitions. Word has length 92 [2025-02-05 16:44:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:16,692 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1243 transitions. [2025-02-05 16:44:16,692 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:44:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1243 transitions. [2025-02-05 16:44:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:16,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:16,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:16,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:44:16,694 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -537578646, now seen corresponding path program 1 times [2025-02-05 16:44:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928835741] [2025-02-05 16:44:16,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:16,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:16,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:16,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:16,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:16,870 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:44:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928835741] [2025-02-05 16:44:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928835741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:16,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556456162] [2025-02-05 16:44:16,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:16,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:16,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:16,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:16,871 INFO L87 Difference]: Start difference. First operand 905 states and 1243 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:44:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:17,669 INFO L93 Difference]: Finished difference Result 1482 states and 2031 transitions. [2025-02-05 16:44:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:17,670 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:44:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:17,674 INFO L225 Difference]: With dead ends: 1482 [2025-02-05 16:44:17,674 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:17,675 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:44:17,675 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 3467 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3467 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:17,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3467 Valid, 1865 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.406568516421291) internal successors, (1242), 904 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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:44:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1242 transitions. [2025-02-05 16:44:17,686 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1242 transitions. Word has length 92 [2025-02-05 16:44:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:17,686 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1242 transitions. [2025-02-05 16:44:17,686 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:44:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1242 transitions. [2025-02-05 16:44:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:17,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:17,687 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:44:17,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:44:17,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:17,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:17,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1895900198, now seen corresponding path program 1 times [2025-02-05 16:44:17,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829856626] [2025-02-05 16:44:17,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:17,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:17,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:17,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:17,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:17,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:18,066 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:44:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829856626] [2025-02-05 16:44:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829856626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:44:18,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843813863] [2025-02-05 16:44:18,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:18,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:44:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:18,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:44:18,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:44:18,068 INFO L87 Difference]: Start difference. First operand 905 states and 1242 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:44:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:19,523 INFO L93 Difference]: Finished difference Result 2094 states and 2956 transitions. [2025-02-05 16:44:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:44:19,523 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:44:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:19,527 INFO L225 Difference]: With dead ends: 2094 [2025-02-05 16:44:19,528 INFO L226 Difference]: Without dead ends: 1923 [2025-02-05 16:44:19,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:44:19,529 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 6193 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6193 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:19,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6193 Valid, 2766 Invalid, 2502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:44:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-02-05 16:44:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 909. [2025-02-05 16:44:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 887 states have (on average 1.4047350620067645) internal successors, (1246), 908 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1246 transitions. [2025-02-05 16:44:19,557 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1246 transitions. Word has length 92 [2025-02-05 16:44:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:19,557 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1246 transitions. [2025-02-05 16:44:19,557 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:44:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1246 transitions. [2025-02-05 16:44:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:19,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:19,558 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:44:19,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:44:19,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 82588328, now seen corresponding path program 1 times [2025-02-05 16:44:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250280493] [2025-02-05 16:44:19,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:19,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:19,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:19,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:19,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:20,053 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:44:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:20,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250280493] [2025-02-05 16:44:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250280493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:20,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280858714] [2025-02-05 16:44:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:20,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:20,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:20,058 INFO L87 Difference]: Start difference. First operand 909 states and 1246 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:44:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:21,035 INFO L93 Difference]: Finished difference Result 1569 states and 2179 transitions. [2025-02-05 16:44:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:21,036 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:44:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:21,041 INFO L225 Difference]: With dead ends: 1569 [2025-02-05 16:44:21,041 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:21,042 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:44:21,042 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 3618 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3618 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:21,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3618 Valid, 2508 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 909. [2025-02-05 16:44:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 887 states have (on average 1.403607666290868) internal successors, (1245), 908 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1245 transitions. [2025-02-05 16:44:21,055 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1245 transitions. Word has length 92 [2025-02-05 16:44:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:21,056 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1245 transitions. [2025-02-05 16:44:21,056 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:44:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1245 transitions. [2025-02-05 16:44:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:44:21,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:21,057 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] [2025-02-05 16:44:21,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:44:21,057 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:44:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1688767669, now seen corresponding path program 1 times [2025-02-05 16:44:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438588281] [2025-02-05 16:44:21,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:21,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:44:21,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:44:21,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:21,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:21,375 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:44:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438588281] [2025-02-05 16:44:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438588281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157748277] [2025-02-05 16:44:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:21,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:21,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:21,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:21,377 INFO L87 Difference]: Start difference. First operand 909 states and 1245 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:44:22,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:22,172 INFO L93 Difference]: Finished difference Result 1340 states and 1811 transitions. [2025-02-05 16:44:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:22,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-02-05 16:44:22,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:22,176 INFO L225 Difference]: With dead ends: 1340 [2025-02-05 16:44:22,176 INFO L226 Difference]: Without dead ends: 1335 [2025-02-05 16:44:22,177 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:44:22,177 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 4588 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4588 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:22,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4588 Valid, 1865 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-05 16:44:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 909. [2025-02-05 16:44:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 887 states have (on average 1.4024802705749717) internal successors, (1244), 908 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:44:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1244 transitions. [2025-02-05 16:44:22,187 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1244 transitions. Word has length 93 [2025-02-05 16:44:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:22,187 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1244 transitions. [2025-02-05 16:44:22,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:44:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1244 transitions. [2025-02-05 16:44:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:22,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:22,188 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:44:22,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:44:22,188 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:22,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1012092232, now seen corresponding path program 1 times [2025-02-05 16:44:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:22,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395000535] [2025-02-05 16:44:22,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:22,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:22,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:22,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:22,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:22,540 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:44:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395000535] [2025-02-05 16:44:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395000535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:22,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:44:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271898640] [2025-02-05 16:44:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:22,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:44:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:22,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:44:22,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:44:22,542 INFO L87 Difference]: Start difference. First operand 909 states and 1244 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:44:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:24,343 INFO L93 Difference]: Finished difference Result 2310 states and 3261 transitions. [2025-02-05 16:44:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:44:24,343 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:44:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:24,348 INFO L225 Difference]: With dead ends: 2310 [2025-02-05 16:44:24,348 INFO L226 Difference]: Without dead ends: 2034 [2025-02-05 16:44:24,349 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:44:24,349 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 4898 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4898 SdHoareTripleChecker+Valid, 4177 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:24,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4898 Valid, 4177 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:44:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2025-02-05 16:44:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 917. [2025-02-05 16:44:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.3988826815642459) internal successors, (1252), 916 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1252 transitions. [2025-02-05 16:44:24,360 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1252 transitions. Word has length 94 [2025-02-05 16:44:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:24,360 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1252 transitions. [2025-02-05 16:44:24,361 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:44:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1252 transitions. [2025-02-05 16:44:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:24,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:24,362 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:44:24,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:44:24,362 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:24,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:24,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1815348273, now seen corresponding path program 1 times [2025-02-05 16:44:24,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:24,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803476833] [2025-02-05 16:44:24,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:24,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:24,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:24,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:24,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:24,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:24,527 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:44:24,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:24,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803476833] [2025-02-05 16:44:24,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803476833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:24,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:24,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:24,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551301244] [2025-02-05 16:44:24,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:24,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:24,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:24,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:24,529 INFO L87 Difference]: Start difference. First operand 917 states and 1252 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:44:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:25,372 INFO L93 Difference]: Finished difference Result 1613 states and 2230 transitions. [2025-02-05 16:44:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:25,373 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:44:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:25,376 INFO L225 Difference]: With dead ends: 1613 [2025-02-05 16:44:25,376 INFO L226 Difference]: Without dead ends: 1411 [2025-02-05 16:44:25,377 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:44:25,378 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 1985 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:25,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1985 Valid, 2502 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-02-05 16:44:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 917. [2025-02-05 16:44:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.3966480446927374) internal successors, (1250), 916 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1250 transitions. [2025-02-05 16:44:25,387 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1250 transitions. Word has length 94 [2025-02-05 16:44:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:25,388 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1250 transitions. [2025-02-05 16:44:25,388 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:44:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1250 transitions. [2025-02-05 16:44:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:25,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:25,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:25,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:44:25,389 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:25,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2032479125, now seen corresponding path program 1 times [2025-02-05 16:44:25,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:25,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708592678] [2025-02-05 16:44:25,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:25,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:25,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:25,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:25,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:25,576 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:44:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708592678] [2025-02-05 16:44:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708592678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:25,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:25,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599784620] [2025-02-05 16:44:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:25,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:25,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:25,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:25,577 INFO L87 Difference]: Start difference. First operand 917 states and 1250 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:44:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:26,651 INFO L93 Difference]: Finished difference Result 1559 states and 2144 transitions. [2025-02-05 16:44:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:26,651 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:44:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:26,654 INFO L225 Difference]: With dead ends: 1559 [2025-02-05 16:44:26,655 INFO L226 Difference]: Without dead ends: 1391 [2025-02-05 16:44:26,659 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:44:26,659 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 3754 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3754 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:26,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3754 Valid, 2716 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:44:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-02-05 16:44:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 917. [2025-02-05 16:44:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.3944134078212291) internal successors, (1248), 916 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1248 transitions. [2025-02-05 16:44:26,676 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1248 transitions. Word has length 94 [2025-02-05 16:44:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:26,676 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1248 transitions. [2025-02-05 16:44:26,676 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:44:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1248 transitions. [2025-02-05 16:44:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:26,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:26,677 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:44:26,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:44:26,678 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:26,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash 137644418, now seen corresponding path program 1 times [2025-02-05 16:44:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398399051] [2025-02-05 16:44:26,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:26,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:26,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:26,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:27,070 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:44:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398399051] [2025-02-05 16:44:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398399051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:27,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:44:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907186678] [2025-02-05 16:44:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:27,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:44:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:27,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:44:27,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:44:27,072 INFO L87 Difference]: Start difference. First operand 917 states and 1248 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:44:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:28,529 INFO L93 Difference]: Finished difference Result 2121 states and 2979 transitions. [2025-02-05 16:44:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:44:28,529 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:44:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:28,533 INFO L225 Difference]: With dead ends: 2121 [2025-02-05 16:44:28,533 INFO L226 Difference]: Without dead ends: 1931 [2025-02-05 16:44:28,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:44:28,535 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 7677 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7677 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:28,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7677 Valid, 2682 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:44:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2025-02-05 16:44:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 925. [2025-02-05 16:44:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.3909191583610188) internal successors, (1256), 924 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1256 transitions. [2025-02-05 16:44:28,546 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1256 transitions. Word has length 94 [2025-02-05 16:44:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:28,547 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1256 transitions. [2025-02-05 16:44:28,547 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:44:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1256 transitions. [2025-02-05 16:44:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:28,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:28,548 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:44:28,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:44:28,548 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:28,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:28,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1748613512, now seen corresponding path program 1 times [2025-02-05 16:44:28,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378744718] [2025-02-05 16:44:28,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:28,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:28,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:28,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:28,804 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:44:28,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378744718] [2025-02-05 16:44:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378744718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111947587] [2025-02-05 16:44:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:28,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:28,806 INFO L87 Difference]: Start difference. First operand 925 states and 1256 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:44:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:29,731 INFO L93 Difference]: Finished difference Result 1563 states and 2144 transitions. [2025-02-05 16:44:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:29,734 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:44:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:29,736 INFO L225 Difference]: With dead ends: 1563 [2025-02-05 16:44:29,736 INFO L226 Difference]: Without dead ends: 1399 [2025-02-05 16:44:29,737 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:44:29,738 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 3750 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3750 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:29,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3750 Valid, 2716 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-02-05 16:44:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 925. [2025-02-05 16:44:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.388704318936877) internal successors, (1254), 924 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1254 transitions. [2025-02-05 16:44:29,746 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1254 transitions. Word has length 94 [2025-02-05 16:44:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:29,746 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1254 transitions. [2025-02-05 16:44:29,746 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:44:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1254 transitions. [2025-02-05 16:44:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:29,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:29,750 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:44:29,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:44:29,750 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:29,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1126271269, now seen corresponding path program 1 times [2025-02-05 16:44:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:29,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316635571] [2025-02-05 16:44:29,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:29,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:29,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:29,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:29,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:30,016 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:44:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316635571] [2025-02-05 16:44:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316635571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:30,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:30,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041002681] [2025-02-05 16:44:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:30,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:30,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:30,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:30,018 INFO L87 Difference]: Start difference. First operand 925 states and 1254 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:44:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:30,683 INFO L93 Difference]: Finished difference Result 1563 states and 2142 transitions. [2025-02-05 16:44:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:30,683 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:44:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:30,685 INFO L225 Difference]: With dead ends: 1563 [2025-02-05 16:44:30,685 INFO L226 Difference]: Without dead ends: 1399 [2025-02-05 16:44:30,686 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:44:30,686 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 3707 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3707 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:30,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3707 Valid, 2214 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:44:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-02-05 16:44:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 925. [2025-02-05 16:44:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.3864894795127354) internal successors, (1252), 924 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1252 transitions. [2025-02-05 16:44:30,706 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1252 transitions. Word has length 94 [2025-02-05 16:44:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1252 transitions. [2025-02-05 16:44:30,706 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:44:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1252 transitions. [2025-02-05 16:44:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:30,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:30,707 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:44:30,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:44:30,707 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2048964979, now seen corresponding path program 1 times [2025-02-05 16:44:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511351800] [2025-02-05 16:44:30,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:30,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:30,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:30,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:30,860 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:44:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:30,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511351800] [2025-02-05 16:44:30,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511351800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:30,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:30,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421786047] [2025-02-05 16:44:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:30,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:30,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:30,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:30,861 INFO L87 Difference]: Start difference. First operand 925 states and 1252 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:44:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:31,468 INFO L93 Difference]: Finished difference Result 1501 states and 2037 transitions. [2025-02-05 16:44:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:31,469 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:44:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:31,471 INFO L225 Difference]: With dead ends: 1501 [2025-02-05 16:44:31,471 INFO L226 Difference]: Without dead ends: 1351 [2025-02-05 16:44:31,471 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:44:31,472 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 2229 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:31,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 1965 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:44:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-02-05 16:44:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 925. [2025-02-05 16:44:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.3842746400885935) internal successors, (1250), 924 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1250 transitions. [2025-02-05 16:44:31,478 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1250 transitions. Word has length 94 [2025-02-05 16:44:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:31,478 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1250 transitions. [2025-02-05 16:44:31,478 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:44:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1250 transitions. [2025-02-05 16:44:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:31,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:31,479 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:44:31,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:44:31,480 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:31,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1182169636, now seen corresponding path program 1 times [2025-02-05 16:44:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027604060] [2025-02-05 16:44:31,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:31,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:31,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:31,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:31,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:32,063 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:44:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:32,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027604060] [2025-02-05 16:44:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027604060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:32,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:44:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168393792] [2025-02-05 16:44:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:44:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:32,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:44:32,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:44:32,068 INFO L87 Difference]: Start difference. First operand 925 states and 1250 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:44:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:33,670 INFO L93 Difference]: Finished difference Result 2111 states and 2955 transitions. [2025-02-05 16:44:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:44:33,671 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:44:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:33,673 INFO L225 Difference]: With dead ends: 2111 [2025-02-05 16:44:33,674 INFO L226 Difference]: Without dead ends: 1931 [2025-02-05 16:44:33,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:44:33,675 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 6801 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 2887 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6801 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:33,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6801 Valid, 3445 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2887 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:44:33,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2025-02-05 16:44:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 929. [2025-02-05 16:44:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 907 states have (on average 1.3825799338478502) internal successors, (1254), 928 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1254 transitions. [2025-02-05 16:44:33,687 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1254 transitions. Word has length 94 [2025-02-05 16:44:33,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:33,687 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1254 transitions. [2025-02-05 16:44:33,687 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:44:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1254 transitions. [2025-02-05 16:44:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:33,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:33,688 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:44:33,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:44:33,689 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:33,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash -974844295, now seen corresponding path program 1 times [2025-02-05 16:44:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017864912] [2025-02-05 16:44:33,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:33,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:33,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:33,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:33,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:33,905 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:44:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:33,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017864912] [2025-02-05 16:44:33,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017864912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:33,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:33,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:33,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448691434] [2025-02-05 16:44:33,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:33,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:33,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:33,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:33,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:33,907 INFO L87 Difference]: Start difference. First operand 929 states and 1254 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:44:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:34,837 INFO L93 Difference]: Finished difference Result 1561 states and 2132 transitions. [2025-02-05 16:44:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:34,837 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:44:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:34,839 INFO L225 Difference]: With dead ends: 1561 [2025-02-05 16:44:34,840 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:34,840 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:44:34,840 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 3738 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3738 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:34,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3738 Valid, 2716 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 929. [2025-02-05 16:44:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 907 states have (on average 1.3814773980154356) internal successors, (1253), 928 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1253 transitions. [2025-02-05 16:44:34,850 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1253 transitions. Word has length 94 [2025-02-05 16:44:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:34,851 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1253 transitions. [2025-02-05 16:44:34,851 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:44:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1253 transitions. [2025-02-05 16:44:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:34,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:34,852 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:44:34,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:44:34,852 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:34,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1371188463, now seen corresponding path program 1 times [2025-02-05 16:44:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924851111] [2025-02-05 16:44:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:34,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:34,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:34,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:34,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:35,049 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:44:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924851111] [2025-02-05 16:44:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924851111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:35,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027980231] [2025-02-05 16:44:35,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:35,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:35,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:35,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:35,051 INFO L87 Difference]: Start difference. First operand 929 states and 1253 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:44:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:35,902 INFO L93 Difference]: Finished difference Result 1582 states and 2171 transitions. [2025-02-05 16:44:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:35,903 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:44:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:35,905 INFO L225 Difference]: With dead ends: 1582 [2025-02-05 16:44:35,905 INFO L226 Difference]: Without dead ends: 1411 [2025-02-05 16:44:35,906 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:44:35,906 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 4360 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:35,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4360 Valid, 2302 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-02-05 16:44:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 929. [2025-02-05 16:44:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 907 states have (on average 1.380374862183021) internal successors, (1252), 928 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1252 transitions. [2025-02-05 16:44:35,914 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1252 transitions. Word has length 94 [2025-02-05 16:44:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:35,914 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1252 transitions. [2025-02-05 16:44:35,914 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:44:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1252 transitions. [2025-02-05 16:44:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:35,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:35,915 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:44:35,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:44:35,915 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:35,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2038755885, now seen corresponding path program 1 times [2025-02-05 16:44:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:35,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51394903] [2025-02-05 16:44:35,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:35,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:35,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:35,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:35,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:36,204 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:44:36,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:36,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51394903] [2025-02-05 16:44:36,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51394903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:36,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:36,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:36,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822808359] [2025-02-05 16:44:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:36,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:36,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:36,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:36,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:36,205 INFO L87 Difference]: Start difference. First operand 929 states and 1252 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:44:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:37,157 INFO L93 Difference]: Finished difference Result 1557 states and 2126 transitions. [2025-02-05 16:44:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:37,157 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:44:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:37,159 INFO L225 Difference]: With dead ends: 1557 [2025-02-05 16:44:37,159 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:37,160 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:44:37,160 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2885 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2885 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:37,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2885 Valid, 2798 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 929. [2025-02-05 16:44:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 907 states have (on average 1.3792723263506064) internal successors, (1251), 928 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1251 transitions. [2025-02-05 16:44:37,168 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1251 transitions. Word has length 94 [2025-02-05 16:44:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:37,168 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1251 transitions. [2025-02-05 16:44:37,169 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:44:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1251 transitions. [2025-02-05 16:44:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:37,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:37,170 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:44:37,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:44:37,170 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:44:37,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash -766706055, now seen corresponding path program 1 times [2025-02-05 16:44:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:37,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149176549] [2025-02-05 16:44:37,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:37,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:37,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:37,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:37,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149176549] [2025-02-05 16:44:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149176549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:37,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468451673] [2025-02-05 16:44:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:37,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:37,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:37,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:37,328 INFO L87 Difference]: Start difference. First operand 929 states and 1251 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:44:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:38,188 INFO L93 Difference]: Finished difference Result 1557 states and 2125 transitions. [2025-02-05 16:44:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:38,189 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:44:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:38,190 INFO L225 Difference]: With dead ends: 1557 [2025-02-05 16:44:38,191 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:38,191 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:44:38,191 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2952 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:38,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 2501 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 929. [2025-02-05 16:44:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 907 states have (on average 1.3781697905181918) internal successors, (1250), 928 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1250 transitions. [2025-02-05 16:44:38,199 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1250 transitions. Word has length 94 [2025-02-05 16:44:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:38,199 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1250 transitions. [2025-02-05 16:44:38,199 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:44:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1250 transitions. [2025-02-05 16:44:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:38,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:38,200 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:44:38,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:44:38,200 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:44:38,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash -424007258, now seen corresponding path program 1 times [2025-02-05 16:44:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83441556] [2025-02-05 16:44:38,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:38,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:38,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:38,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:38,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:38,393 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:44:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83441556] [2025-02-05 16:44:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83441556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:38,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216798453] [2025-02-05 16:44:38,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:38,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:38,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:38,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:38,394 INFO L87 Difference]: Start difference. First operand 929 states and 1250 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:44:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:39,242 INFO L93 Difference]: Finished difference Result 1557 states and 2124 transitions. [2025-02-05 16:44:39,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:39,242 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:44:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:39,245 INFO L225 Difference]: With dead ends: 1557 [2025-02-05 16:44:39,245 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:39,245 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:44:39,246 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 2879 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:39,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2532 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 929. [2025-02-05 16:44:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 907 states have (on average 1.3770672546857774) internal successors, (1249), 928 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1249 transitions. [2025-02-05 16:44:39,268 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1249 transitions. Word has length 94 [2025-02-05 16:44:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1249 transitions. [2025-02-05 16:44:39,268 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:44:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1249 transitions. [2025-02-05 16:44:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:44:39,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:39,269 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:44:39,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:44:39,269 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:39,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash -980982704, now seen corresponding path program 1 times [2025-02-05 16:44:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:39,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551471072] [2025-02-05 16:44:39,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:39,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:39,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:44:39,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:44:39,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:39,580 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:44:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:39,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551471072] [2025-02-05 16:44:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551471072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:39,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:39,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374374481] [2025-02-05 16:44:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:39,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:39,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:39,582 INFO L87 Difference]: Start difference. First operand 929 states and 1249 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:44:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:40,431 INFO L93 Difference]: Finished difference Result 1420 states and 1909 transitions. [2025-02-05 16:44:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:40,431 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:44:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:40,434 INFO L225 Difference]: With dead ends: 1420 [2025-02-05 16:44:40,434 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:40,434 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:44:40,435 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 3139 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3139 SdHoareTripleChecker+Valid, 2296 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:40,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3139 Valid, 2296 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 929. [2025-02-05 16:44:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 907 states have (on average 1.3748621830209482) internal successors, (1247), 928 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1247 transitions. [2025-02-05 16:44:40,443 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1247 transitions. Word has length 95 [2025-02-05 16:44:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:40,444 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1247 transitions. [2025-02-05 16:44:40,444 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:44:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1247 transitions. [2025-02-05 16:44:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:44:40,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:40,445 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:44:40,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:44:40,445 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:40,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1351286322, now seen corresponding path program 1 times [2025-02-05 16:44:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:40,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213381522] [2025-02-05 16:44:40,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:40,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:44:40,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:44:40,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:40,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:40,638 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:44:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:40,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213381522] [2025-02-05 16:44:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213381522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:40,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:40,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475978758] [2025-02-05 16:44:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:40,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:40,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:40,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:40,641 INFO L87 Difference]: Start difference. First operand 929 states and 1247 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:44:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:41,389 INFO L93 Difference]: Finished difference Result 1601 states and 2183 transitions. [2025-02-05 16:44:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:41,389 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:44:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:41,391 INFO L225 Difference]: With dead ends: 1601 [2025-02-05 16:44:41,391 INFO L226 Difference]: Without dead ends: 1411 [2025-02-05 16:44:41,391 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:44:41,392 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 4166 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4166 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:41,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4166 Valid, 2383 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-02-05 16:44:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 921. [2025-02-05 16:44:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 899 states have (on average 1.3759733036707453) internal successors, (1237), 920 states have internal predecessors, (1237), 0 states have call successors, (0), 0 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:44:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1237 transitions. [2025-02-05 16:44:41,401 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1237 transitions. Word has length 95 [2025-02-05 16:44:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:41,401 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1237 transitions. [2025-02-05 16:44:41,401 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:44:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1237 transitions. [2025-02-05 16:44:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:44:41,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:41,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:41,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:44:41,402 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:41,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash -934655431, now seen corresponding path program 1 times [2025-02-05 16:44:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136242055] [2025-02-05 16:44:41,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:41,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:44:41,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:44:41,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:41,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136242055] [2025-02-05 16:44:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136242055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:41,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535905634] [2025-02-05 16:44:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:41,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:41,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:41,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:41,578 INFO L87 Difference]: Start difference. First operand 921 states and 1237 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:44:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:42,488 INFO L93 Difference]: Finished difference Result 1718 states and 2349 transitions. [2025-02-05 16:44:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:42,489 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:44:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:42,491 INFO L225 Difference]: With dead ends: 1718 [2025-02-05 16:44:42,494 INFO L226 Difference]: Without dead ends: 1442 [2025-02-05 16:44:42,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:44:42,496 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 3398 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:42,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3398 Valid, 3077 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-02-05 16:44:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 913. [2025-02-05 16:44:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 891 states have (on average 1.3771043771043772) internal successors, (1227), 912 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1227 transitions. [2025-02-05 16:44:42,515 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1227 transitions. Word has length 95 [2025-02-05 16:44:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:42,515 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1227 transitions. [2025-02-05 16:44:42,515 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:44:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1227 transitions. [2025-02-05 16:44:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:44:42,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:42,516 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:44:42,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:44:42,517 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:42,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash -202884884, now seen corresponding path program 1 times [2025-02-05 16:44:42,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:42,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923976599] [2025-02-05 16:44:42,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:42,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:44:42,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:44:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923976599] [2025-02-05 16:44:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923976599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:42,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570507874] [2025-02-05 16:44:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:42,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:42,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:42,769 INFO L87 Difference]: Start difference. First operand 913 states and 1227 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:44:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:43,555 INFO L93 Difference]: Finished difference Result 1583 states and 2159 transitions. [2025-02-05 16:44:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:43,555 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:44:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:43,557 INFO L225 Difference]: With dead ends: 1583 [2025-02-05 16:44:43,558 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:43,559 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:44:43,559 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 2830 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2830 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:43,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2830 Valid, 2731 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:44:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 909. [2025-02-05 16:44:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 887 states have (on average 1.3776775648252537) internal successors, (1222), 908 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1222 transitions. [2025-02-05 16:44:43,573 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1222 transitions. Word has length 95 [2025-02-05 16:44:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:43,573 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1222 transitions. [2025-02-05 16:44:43,573 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:44:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1222 transitions. [2025-02-05 16:44:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:44:43,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:43,578 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:44:43,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:44:43,578 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:44:43,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1491027213, now seen corresponding path program 1 times [2025-02-05 16:44:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342239235] [2025-02-05 16:44:43,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:44:43,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:44:43,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:43,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:43,763 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:44:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342239235] [2025-02-05 16:44:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342239235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:43,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:43,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069243238] [2025-02-05 16:44:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:43,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:43,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:43,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:43,764 INFO L87 Difference]: Start difference. First operand 909 states and 1222 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:44:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:44,565 INFO L93 Difference]: Finished difference Result 1536 states and 2092 transitions. [2025-02-05 16:44:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:44,565 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:44:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:44,567 INFO L225 Difference]: With dead ends: 1536 [2025-02-05 16:44:44,567 INFO L226 Difference]: Without dead ends: 1383 [2025-02-05 16:44:44,567 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:44:44,567 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 3581 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3581 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:44,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3581 Valid, 2992 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-02-05 16:44:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 909. [2025-02-05 16:44:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 887 states have (on average 1.3765501691093573) internal successors, (1221), 908 states have internal predecessors, (1221), 0 states have call successors, (0), 0 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:44:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1221 transitions. [2025-02-05 16:44:44,597 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1221 transitions. Word has length 95 [2025-02-05 16:44:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:44,597 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1221 transitions. [2025-02-05 16:44:44,597 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:44:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1221 transitions. [2025-02-05 16:44:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:44:44,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:44,598 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:44:44,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:44:44,598 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1798153714, now seen corresponding path program 1 times [2025-02-05 16:44:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655744978] [2025-02-05 16:44:44,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:44,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:44:44,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:44:44,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:44,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:44,739 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:44:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655744978] [2025-02-05 16:44:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655744978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:44,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:44,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:44,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816659046] [2025-02-05 16:44:44,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:44,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:44,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:44,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:44,741 INFO L87 Difference]: Start difference. First operand 909 states and 1221 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:44:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:45,525 INFO L93 Difference]: Finished difference Result 1574 states and 2147 transitions. [2025-02-05 16:44:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:45,528 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:44:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:45,529 INFO L225 Difference]: With dead ends: 1574 [2025-02-05 16:44:45,529 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:45,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:44:45,531 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 2761 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2761 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:45,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2761 Valid, 2799 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 905. [2025-02-05 16:44:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.377123442808607) internal successors, (1216), 904 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:44:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1216 transitions. [2025-02-05 16:44:45,546 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1216 transitions. Word has length 95 [2025-02-05 16:44:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:45,546 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1216 transitions. [2025-02-05 16:44:45,546 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:44:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1216 transitions. [2025-02-05 16:44:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:45,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:45,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:45,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:44:45,547 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:45,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash -781771315, now seen corresponding path program 1 times [2025-02-05 16:44:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395410659] [2025-02-05 16:44:45,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:45,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:45,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:45,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:45,821 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:44:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:45,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395410659] [2025-02-05 16:44:45,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395410659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:45,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:45,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:45,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035978360] [2025-02-05 16:44:45,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:45,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:45,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:45,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:45,824 INFO L87 Difference]: Start difference. First operand 905 states and 1216 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:44:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:46,676 INFO L93 Difference]: Finished difference Result 1549 states and 2106 transitions. [2025-02-05 16:44:46,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:46,676 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:44:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:46,678 INFO L225 Difference]: With dead ends: 1549 [2025-02-05 16:44:46,678 INFO L226 Difference]: Without dead ends: 1379 [2025-02-05 16:44:46,678 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:44:46,679 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 3533 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3533 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:46,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3533 Valid, 2738 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-02-05 16:44:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 905. [2025-02-05 16:44:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3748584371460928) internal successors, (1214), 904 states have internal predecessors, (1214), 0 states have call successors, (0), 0 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:44:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1214 transitions. [2025-02-05 16:44:46,687 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1214 transitions. Word has length 96 [2025-02-05 16:44:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:46,688 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1214 transitions. [2025-02-05 16:44:46,688 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:44:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1214 transitions. [2025-02-05 16:44:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:46,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:46,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:46,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:44:46,689 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:46,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1550497711, now seen corresponding path program 1 times [2025-02-05 16:44:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:46,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573747156] [2025-02-05 16:44:46,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:46,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:46,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:46,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:46,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:46,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:46,853 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:44:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573747156] [2025-02-05 16:44:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573747156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539523000] [2025-02-05 16:44:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:46,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:46,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:46,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:46,854 INFO L87 Difference]: Start difference. First operand 905 states and 1214 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:44:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:47,554 INFO L93 Difference]: Finished difference Result 1485 states and 2002 transitions. [2025-02-05 16:44:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:47,555 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:44:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:47,556 INFO L225 Difference]: With dead ends: 1485 [2025-02-05 16:44:47,556 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:47,557 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:44:47,557 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 3844 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3844 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:47,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3844 Valid, 2374 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:44:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3725934314835788) internal successors, (1212), 904 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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:44:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1212 transitions. [2025-02-05 16:44:47,565 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1212 transitions. Word has length 96 [2025-02-05 16:44:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:47,565 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1212 transitions. [2025-02-05 16:44:47,565 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:44:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1212 transitions. [2025-02-05 16:44:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:47,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:47,566 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:44:47,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:44:47,566 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1225873890, now seen corresponding path program 1 times [2025-02-05 16:44:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991087818] [2025-02-05 16:44:47,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:47,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:47,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:47,719 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:44:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991087818] [2025-02-05 16:44:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991087818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:47,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:47,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944313814] [2025-02-05 16:44:47,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:47,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:47,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:47,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:47,721 INFO L87 Difference]: Start difference. First operand 905 states and 1212 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:44:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:48,570 INFO L93 Difference]: Finished difference Result 1485 states and 2000 transitions. [2025-02-05 16:44:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:48,571 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:44:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:48,572 INFO L225 Difference]: With dead ends: 1485 [2025-02-05 16:44:48,572 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:48,573 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:44:48,574 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 4065 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 2173 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:44:48,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 2173 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3703284258210646) internal successors, (1210), 904 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:44:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1210 transitions. [2025-02-05 16:44:48,592 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1210 transitions. Word has length 96 [2025-02-05 16:44:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:48,592 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1210 transitions. [2025-02-05 16:44:48,592 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:44:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1210 transitions. [2025-02-05 16:44:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:48,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:48,593 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:44:48,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:44:48,594 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:48,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1121539455, now seen corresponding path program 1 times [2025-02-05 16:44:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537075759] [2025-02-05 16:44:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:48,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:48,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:48,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:48,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:48,770 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:44:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:48,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537075759] [2025-02-05 16:44:48,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537075759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:48,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:48,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:48,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601103768] [2025-02-05 16:44:48,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:48,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:48,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:48,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:48,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:48,772 INFO L87 Difference]: Start difference. First operand 905 states and 1210 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:44:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:49,564 INFO L93 Difference]: Finished difference Result 1481 states and 1991 transitions. [2025-02-05 16:44:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:49,564 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:44:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:49,565 INFO L225 Difference]: With dead ends: 1481 [2025-02-05 16:44:49,565 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:49,566 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:44:49,566 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 3090 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:49,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3090 Valid, 2184 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3680634201585504) internal successors, (1208), 904 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1208 transitions. [2025-02-05 16:44:49,574 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1208 transitions. Word has length 96 [2025-02-05 16:44:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:49,574 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1208 transitions. [2025-02-05 16:44:49,574 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:44:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1208 transitions. [2025-02-05 16:44:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:49,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:49,575 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:44:49,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:44:49,575 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1849890969, now seen corresponding path program 1 times [2025-02-05 16:44:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775080032] [2025-02-05 16:44:49,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:49,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:49,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:49,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:49,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:49,731 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:44:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775080032] [2025-02-05 16:44:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775080032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:49,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:49,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470530691] [2025-02-05 16:44:49,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:49,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:49,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:49,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:49,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:49,734 INFO L87 Difference]: Start difference. First operand 905 states and 1208 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:44:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:50,663 INFO L93 Difference]: Finished difference Result 1613 states and 2187 transitions. [2025-02-05 16:44:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:50,663 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:44:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:50,664 INFO L225 Difference]: With dead ends: 1613 [2025-02-05 16:44:50,664 INFO L226 Difference]: Without dead ends: 1403 [2025-02-05 16:44:50,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:44:50,665 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 2536 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:50,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2536 Valid, 3001 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-02-05 16:44:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 905. [2025-02-05 16:44:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3657984144960362) internal successors, (1206), 904 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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:44:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1206 transitions. [2025-02-05 16:44:50,676 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1206 transitions. Word has length 96 [2025-02-05 16:44:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:50,676 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1206 transitions. [2025-02-05 16:44:50,676 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:44:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1206 transitions. [2025-02-05 16:44:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:50,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:50,680 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:44:50,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:44:50,681 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:50,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2077132105, now seen corresponding path program 1 times [2025-02-05 16:44:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:50,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741889556] [2025-02-05 16:44:50,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:50,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:50,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:50,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:50,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:50,862 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:44:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741889556] [2025-02-05 16:44:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741889556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642746203] [2025-02-05 16:44:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:50,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:50,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:50,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:50,863 INFO L87 Difference]: Start difference. First operand 905 states and 1206 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:44:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:51,805 INFO L93 Difference]: Finished difference Result 1549 states and 2092 transitions. [2025-02-05 16:44:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-05 16:44:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:51,807 INFO L225 Difference]: With dead ends: 1549 [2025-02-05 16:44:51,807 INFO L226 Difference]: Without dead ends: 1379 [2025-02-05 16:44:51,807 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:44:51,808 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 3468 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3468 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:51,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3468 Valid, 3184 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-02-05 16:44:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 905. [2025-02-05 16:44:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.363533408833522) internal successors, (1204), 904 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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:44:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1204 transitions. [2025-02-05 16:44:51,814 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1204 transitions. Word has length 96 [2025-02-05 16:44:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:51,814 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1204 transitions. [2025-02-05 16:44:51,815 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:44:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1204 transitions. [2025-02-05 16:44:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:51,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:51,816 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:44:51,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:44:51,816 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:51,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash 114433835, now seen corresponding path program 1 times [2025-02-05 16:44:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:51,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997474218] [2025-02-05 16:44:51,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:51,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:51,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:51,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:51,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:51,984 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:44:51,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997474218] [2025-02-05 16:44:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997474218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:51,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695985655] [2025-02-05 16:44:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:51,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:51,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:51,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:51,987 INFO L87 Difference]: Start difference. First operand 905 states and 1204 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:44:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:52,840 INFO L93 Difference]: Finished difference Result 1485 states and 1990 transitions. [2025-02-05 16:44:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:52,841 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:44:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:52,842 INFO L225 Difference]: With dead ends: 1485 [2025-02-05 16:44:52,842 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:52,843 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:44:52,845 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 4047 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4047 SdHoareTripleChecker+Valid, 2240 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:44:52,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4047 Valid, 2240 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3612684031710078) internal successors, (1202), 904 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:44:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1202 transitions. [2025-02-05 16:44:52,853 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1202 transitions. Word has length 96 [2025-02-05 16:44:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:52,855 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1202 transitions. [2025-02-05 16:44:52,855 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:44:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1202 transitions. [2025-02-05 16:44:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:52,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:52,856 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:44:52,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 16:44:52,856 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:52,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1639999138, now seen corresponding path program 1 times [2025-02-05 16:44:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080574188] [2025-02-05 16:44:52,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:52,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:52,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:52,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:52,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:53,025 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:44:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080574188] [2025-02-05 16:44:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080574188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:53,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:53,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:53,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134013959] [2025-02-05 16:44:53,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:53,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:53,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:53,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:53,026 INFO L87 Difference]: Start difference. First operand 905 states and 1202 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:44:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:53,822 INFO L93 Difference]: Finished difference Result 1336 states and 1763 transitions. [2025-02-05 16:44:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:53,822 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:44:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:53,824 INFO L225 Difference]: With dead ends: 1336 [2025-02-05 16:44:53,824 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:53,824 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:44:53,824 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 4043 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4043 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:53,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4043 Valid, 2240 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3590033975084939) internal successors, (1200), 904 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:44:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1200 transitions. [2025-02-05 16:44:53,831 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1200 transitions. Word has length 96 [2025-02-05 16:44:53,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:53,831 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1200 transitions. [2025-02-05 16:44:53,831 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:44:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1200 transitions. [2025-02-05 16:44:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:53,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:53,832 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:44:53,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 16:44:53,832 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -921482987, now seen corresponding path program 1 times [2025-02-05 16:44:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:53,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970575351] [2025-02-05 16:44:53,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:53,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:53,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:53,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:53,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:53,974 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:44:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970575351] [2025-02-05 16:44:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970575351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:53,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665497450] [2025-02-05 16:44:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:53,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:53,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:53,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:53,975 INFO L87 Difference]: Start difference. First operand 905 states and 1200 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:44:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:54,769 INFO L93 Difference]: Finished difference Result 1336 states and 1761 transitions. [2025-02-05 16:44:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:54,769 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:44:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:54,771 INFO L225 Difference]: With dead ends: 1336 [2025-02-05 16:44:54,771 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:54,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:44:54,772 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 2997 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:54,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 2225 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3567383918459797) internal successors, (1198), 904 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1198 transitions. [2025-02-05 16:44:54,778 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1198 transitions. Word has length 96 [2025-02-05 16:44:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:54,778 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1198 transitions. [2025-02-05 16:44:54,778 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:44:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1198 transitions. [2025-02-05 16:44:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:54,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:54,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:54,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 16:44:54,780 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:54,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:54,780 INFO L85 PathProgramCache]: Analyzing trace with hash 111700676, now seen corresponding path program 1 times [2025-02-05 16:44:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:54,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136921738] [2025-02-05 16:44:54,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:54,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:54,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:54,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:54,941 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:44:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136921738] [2025-02-05 16:44:54,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136921738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:54,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:54,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153986124] [2025-02-05 16:44:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:54,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:54,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:54,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:54,942 INFO L87 Difference]: Start difference. First operand 905 states and 1198 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:44:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:55,758 INFO L93 Difference]: Finished difference Result 1481 states and 1977 transitions. [2025-02-05 16:44:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:55,759 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:44:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:55,760 INFO L225 Difference]: With dead ends: 1481 [2025-02-05 16:44:55,760 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:55,760 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:44:55,760 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2847 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2847 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:55,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2847 Valid, 2691 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:44:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 905. [2025-02-05 16:44:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 883 states have (on average 1.3544733861834655) internal successors, (1196), 904 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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:44:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1196 transitions. [2025-02-05 16:44:55,768 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1196 transitions. Word has length 96 [2025-02-05 16:44:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:55,768 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1196 transitions. [2025-02-05 16:44:55,768 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:44:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1196 transitions. [2025-02-05 16:44:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:55,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:55,769 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:44:55,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 16:44:55,769 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:55,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2021814712, now seen corresponding path program 1 times [2025-02-05 16:44:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811185226] [2025-02-05 16:44:55,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:55,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811185226] [2025-02-05 16:44:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811185226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:44:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045054411] [2025-02-05 16:44:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:56,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:44:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:56,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:44:56,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:44:56,131 INFO L87 Difference]: Start difference. First operand 905 states and 1196 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:44:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:57,304 INFO L93 Difference]: Finished difference Result 1696 states and 2287 transitions. [2025-02-05 16:44:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:44:57,305 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:44:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:57,306 INFO L225 Difference]: With dead ends: 1696 [2025-02-05 16:44:57,306 INFO L226 Difference]: Without dead ends: 1691 [2025-02-05 16:44:57,307 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:44:57,307 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 5955 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5955 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:57,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5955 Valid, 2831 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:44:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2025-02-05 16:44:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 913. [2025-02-05 16:44:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 891 states have (on average 1.351290684624018) internal successors, (1204), 912 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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:44:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1204 transitions. [2025-02-05 16:44:57,324 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1204 transitions. Word has length 96 [2025-02-05 16:44:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:57,324 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1204 transitions. [2025-02-05 16:44:57,324 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:44:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1204 transitions. [2025-02-05 16:44:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:57,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:57,325 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:44:57,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 16:44:57,326 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:44:57,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -987746286, now seen corresponding path program 1 times [2025-02-05 16:44:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542788980] [2025-02-05 16:44:57,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:57,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:57,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:57,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:57,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542788980] [2025-02-05 16:44:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542788980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159351651] [2025-02-05 16:44:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:57,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:57,547 INFO L87 Difference]: Start difference. First operand 913 states and 1204 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:44:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:58,455 INFO L93 Difference]: Finished difference Result 1481 states and 1973 transitions. [2025-02-05 16:44:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:58,455 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:44:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:58,456 INFO L225 Difference]: With dead ends: 1481 [2025-02-05 16:44:58,456 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:44:58,457 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:44:58,459 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2848 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2848 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:58,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2848 Valid, 2679 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:44:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 913. [2025-02-05 16:44:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 891 states have (on average 1.3490460157126825) internal successors, (1202), 912 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:44:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1202 transitions. [2025-02-05 16:44:58,468 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1202 transitions. Word has length 96 [2025-02-05 16:44:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:58,468 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1202 transitions. [2025-02-05 16:44:58,468 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:44:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1202 transitions. [2025-02-05 16:44:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:58,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:58,469 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:44:58,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 16:44:58,469 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:44:58,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1046235730, now seen corresponding path program 1 times [2025-02-05 16:44:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981830202] [2025-02-05 16:44:58,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:58,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:58,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:58,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:58,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:58,649 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:44:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981830202] [2025-02-05 16:44:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981830202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:58,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:58,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487721988] [2025-02-05 16:44:58,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:58,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:58,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:58,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:58,650 INFO L87 Difference]: Start difference. First operand 913 states and 1202 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:44:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:59,654 INFO L93 Difference]: Finished difference Result 1557 states and 2082 transitions. [2025-02-05 16:44:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:44:59,654 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:44:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:59,655 INFO L225 Difference]: With dead ends: 1557 [2025-02-05 16:44:59,655 INFO L226 Difference]: Without dead ends: 1395 [2025-02-05 16:44:59,656 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:44:59,656 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 3446 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3446 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:59,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3446 Valid, 3184 Invalid, 2332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:44:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-02-05 16:44:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 913. [2025-02-05 16:44:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 891 states have (on average 1.3468013468013469) internal successors, (1200), 912 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:44:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1200 transitions. [2025-02-05 16:44:59,664 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1200 transitions. Word has length 96 [2025-02-05 16:44:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1200 transitions. [2025-02-05 16:44:59,664 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:44:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1200 transitions. [2025-02-05 16:44:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:59,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:59,665 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:44:59,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 16:44:59,665 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:44:59,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1593684681, now seen corresponding path program 1 times [2025-02-05 16:44:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553424379] [2025-02-05 16:44:59,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:59,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:59,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:59,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:59,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:59,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553424379] [2025-02-05 16:44:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553424379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:59,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737999138] [2025-02-05 16:44:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:59,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:59,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:59,839 INFO L87 Difference]: Start difference. First operand 913 states and 1200 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:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:00,695 INFO L93 Difference]: Finished difference Result 1479 states and 1967 transitions. [2025-02-05 16:45:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:00,695 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:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:00,696 INFO L225 Difference]: With dead ends: 1479 [2025-02-05 16:45:00,696 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:45:00,697 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:00,697 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 3724 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3724 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:00,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3724 Valid, 2430 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:45:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 913. [2025-02-05 16:45:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 891 states have (on average 1.345679012345679) internal successors, (1199), 912 states have internal predecessors, (1199), 0 states have call successors, (0), 0 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:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1199 transitions. [2025-02-05 16:45:00,705 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1199 transitions. Word has length 96 [2025-02-05 16:45:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:00,705 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1199 transitions. [2025-02-05 16:45:00,705 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:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1199 transitions. [2025-02-05 16:45:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:00,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:00,706 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:00,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 16:45:00,706 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-02-05 16:45:00,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -834057870, now seen corresponding path program 1 times [2025-02-05 16:45:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481793696] [2025-02-05 16:45:00,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:00,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:00,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:00,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:00,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:00,975 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:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481793696] [2025-02-05 16:45:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481793696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551660881] [2025-02-05 16:45:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:00,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:00,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:00,976 INFO L87 Difference]: Start difference. First operand 913 states and 1199 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:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:02,012 INFO L93 Difference]: Finished difference Result 1842 states and 2501 transitions. [2025-02-05 16:45:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:45:02,012 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:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:02,014 INFO L225 Difference]: With dead ends: 1842 [2025-02-05 16:45:02,014 INFO L226 Difference]: Without dead ends: 1691 [2025-02-05 16:45:02,015 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:45:02,015 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 7178 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7178 SdHoareTripleChecker+Valid, 2839 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:02,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7178 Valid, 2839 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2025-02-05 16:45:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 917. [2025-02-05 16:45:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.3441340782122906) internal successors, (1203), 916 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1203 transitions. [2025-02-05 16:45:02,021 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1203 transitions. Word has length 96 [2025-02-05 16:45:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:02,022 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1203 transitions. [2025-02-05 16:45:02,022 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:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1203 transitions. [2025-02-05 16:45:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:02,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:02,023 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:02,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 16:45:02,023 INFO L396 AbstractCegarLoop]: === Iteration 52 === 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:02,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 582540934, now seen corresponding path program 1 times [2025-02-05 16:45:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343461106] [2025-02-05 16:45:02,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:02,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:02,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:02,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:02,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:02,195 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:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343461106] [2025-02-05 16:45:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343461106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:02,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716904345] [2025-02-05 16:45:02,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:02,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:02,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:02,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:02,196 INFO L87 Difference]: Start difference. First operand 917 states and 1203 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:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:02,999 INFO L93 Difference]: Finished difference Result 1562 states and 2082 transitions. [2025-02-05 16:45:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:02,999 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:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:03,000 INFO L225 Difference]: With dead ends: 1562 [2025-02-05 16:45:03,000 INFO L226 Difference]: Without dead ends: 1399 [2025-02-05 16:45:03,001 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:03,001 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 1746 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:03,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 2878 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-02-05 16:45:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 917. [2025-02-05 16:45:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.3430167597765363) internal successors, (1202), 916 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1202 transitions. [2025-02-05 16:45:03,025 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1202 transitions. Word has length 96 [2025-02-05 16:45:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:03,025 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1202 transitions. [2025-02-05 16:45:03,025 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:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1202 transitions. [2025-02-05 16:45:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:03,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:03,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:03,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 16:45:03,027 INFO L396 AbstractCegarLoop]: === Iteration 53 === 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:03,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1890013096, now seen corresponding path program 1 times [2025-02-05 16:45:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:03,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128325945] [2025-02-05 16:45:03,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:03,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:03,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:03,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:03,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:03,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:03,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128325945] [2025-02-05 16:45:03,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128325945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:03,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:03,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:03,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629171305] [2025-02-05 16:45:03,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:03,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:03,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:03,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:03,305 INFO L87 Difference]: Start difference. First operand 917 states and 1202 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:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:04,069 INFO L93 Difference]: Finished difference Result 1482 states and 1967 transitions. [2025-02-05 16:45:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:04,069 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:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:04,071 INFO L225 Difference]: With dead ends: 1482 [2025-02-05 16:45:04,071 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:45:04,071 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:04,072 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 3951 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3951 SdHoareTripleChecker+Valid, 2284 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:45:04,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3951 Valid, 2284 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:45:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 917. [2025-02-05 16:45:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.341899441340782) internal successors, (1201), 916 states have internal predecessors, (1201), 0 states have call successors, (0), 0 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:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1201 transitions. [2025-02-05 16:45:04,079 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1201 transitions. Word has length 96 [2025-02-05 16:45:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:04,080 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1201 transitions. [2025-02-05 16:45:04,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1201 transitions. [2025-02-05 16:45:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:04,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:04,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:04,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-05 16:45:04,081 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:45:04,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash 693597107, now seen corresponding path program 1 times [2025-02-05 16:45:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:04,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470287305] [2025-02-05 16:45:04,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:04,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:04,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:04,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:04,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:04,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:04,249 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:04,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:04,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470287305] [2025-02-05 16:45:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470287305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:04,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269798804] [2025-02-05 16:45:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:04,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:04,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:04,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:04,251 INFO L87 Difference]: Start difference. First operand 917 states and 1201 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:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:05,041 INFO L93 Difference]: Finished difference Result 1479 states and 1963 transitions. [2025-02-05 16:45:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:05,042 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:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:05,043 INFO L225 Difference]: With dead ends: 1479 [2025-02-05 16:45:05,043 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 16:45:05,043 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:05,044 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 2805 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2805 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:05,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2805 Valid, 2731 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 16:45:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 917. [2025-02-05 16:45:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.3407821229050279) internal successors, (1200), 916 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1200 transitions. [2025-02-05 16:45:05,050 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1200 transitions. Word has length 96 [2025-02-05 16:45:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:05,050 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1200 transitions. [2025-02-05 16:45:05,050 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:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1200 transitions. [2025-02-05 16:45:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:05,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:05,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:05,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-05 16:45:05,051 INFO L396 AbstractCegarLoop]: === Iteration 55 === 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:05,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash -360139435, now seen corresponding path program 1 times [2025-02-05 16:45:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972934506] [2025-02-05 16:45:05,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:05,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:05,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:05,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:05,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:05,324 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:05,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972934506] [2025-02-05 16:45:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972934506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545099536] [2025-02-05 16:45:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:05,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:05,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:05,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:05,325 INFO L87 Difference]: Start difference. First operand 917 states and 1200 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:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:06,625 INFO L93 Difference]: Finished difference Result 1997 states and 2723 transitions. [2025-02-05 16:45:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:45:06,625 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:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:06,627 INFO L225 Difference]: With dead ends: 1997 [2025-02-05 16:45:06,627 INFO L226 Difference]: Without dead ends: 1839 [2025-02-05 16:45:06,627 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:45:06,627 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 5689 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5689 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:06,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5689 Valid, 2817 Invalid, 2319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-02-05 16:45:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 921. [2025-02-05 16:45:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 899 states have (on average 1.3392658509454949) internal successors, (1204), 920 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1204 transitions. [2025-02-05 16:45:06,640 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1204 transitions. Word has length 96 [2025-02-05 16:45:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1204 transitions. [2025-02-05 16:45:06,640 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:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1204 transitions. [2025-02-05 16:45:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:06,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:06,641 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:06,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-05 16:45:06,641 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:45:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1402498976, now seen corresponding path program 1 times [2025-02-05 16:45:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118420568] [2025-02-05 16:45:06,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:06,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:06,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:06,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:06,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:06,833 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:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:06,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118420568] [2025-02-05 16:45:06,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118420568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:06,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:06,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418292058] [2025-02-05 16:45:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:06,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:06,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:06,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:06,836 INFO L87 Difference]: Start difference. First operand 921 states and 1204 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:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:07,598 INFO L93 Difference]: Finished difference Result 1483 states and 1966 transitions. [2025-02-05 16:45:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:07,599 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:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:07,600 INFO L225 Difference]: With dead ends: 1483 [2025-02-05 16:45:07,600 INFO L226 Difference]: Without dead ends: 1335 [2025-02-05 16:45:07,600 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:07,601 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 3338 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:07,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 2260 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-05 16:45:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 921. [2025-02-05 16:45:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 899 states have (on average 1.3381535038932146) internal successors, (1203), 920 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1203 transitions. [2025-02-05 16:45:07,613 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1203 transitions. Word has length 96 [2025-02-05 16:45:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:07,614 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1203 transitions. [2025-02-05 16:45:07,614 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:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1203 transitions. [2025-02-05 16:45:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:07,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:07,615 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:07,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-05 16:45:07,615 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:45:07,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1765367969, now seen corresponding path program 1 times [2025-02-05 16:45:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:07,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869323027] [2025-02-05 16:45:07,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:07,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:07,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:07,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:07,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:07,938 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:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869323027] [2025-02-05 16:45:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869323027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:07,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700383874] [2025-02-05 16:45:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:07,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:07,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:07,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:07,940 INFO L87 Difference]: Start difference. First operand 921 states and 1203 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:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:09,313 INFO L93 Difference]: Finished difference Result 1997 states and 2720 transitions. [2025-02-05 16:45:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:45:09,314 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:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:09,316 INFO L225 Difference]: With dead ends: 1997 [2025-02-05 16:45:09,316 INFO L226 Difference]: Without dead ends: 1839 [2025-02-05 16:45:09,316 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:09,317 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 4979 mSDsluCounter, 2367 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4979 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:09,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4979 Valid, 3046 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:45:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-02-05 16:45:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 925. [2025-02-05 16:45:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.336655592469546) internal successors, (1207), 924 states have internal predecessors, (1207), 0 states have call successors, (0), 0 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:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1207 transitions. [2025-02-05 16:45:09,325 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1207 transitions. Word has length 96 [2025-02-05 16:45:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:09,325 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1207 transitions. [2025-02-05 16:45:09,325 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:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1207 transitions. [2025-02-05 16:45:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:09,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:09,326 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:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-05 16:45:09,326 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:45:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1475862785, now seen corresponding path program 1 times [2025-02-05 16:45:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:09,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946795813] [2025-02-05 16:45:09,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:09,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:09,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:09,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:09,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:09,504 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:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946795813] [2025-02-05 16:45:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946795813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:09,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:09,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822167062] [2025-02-05 16:45:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:09,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:09,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:09,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:09,505 INFO L87 Difference]: Start difference. First operand 925 states and 1207 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:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:10,345 INFO L93 Difference]: Finished difference Result 1487 states and 1968 transitions. [2025-02-05 16:45:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:10,346 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:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:10,347 INFO L225 Difference]: With dead ends: 1487 [2025-02-05 16:45:10,347 INFO L226 Difference]: Without dead ends: 1339 [2025-02-05 16:45:10,347 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:10,348 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 3648 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3648 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:10,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3648 Valid, 2486 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-02-05 16:45:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 925. [2025-02-05 16:45:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.3355481727574752) internal successors, (1206), 924 states have internal predecessors, (1206), 0 states have call successors, (0), 0 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:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1206 transitions. [2025-02-05 16:45:10,354 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1206 transitions. Word has length 96 [2025-02-05 16:45:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:10,354 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1206 transitions. [2025-02-05 16:45:10,354 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:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1206 transitions. [2025-02-05 16:45:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:10,355 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:10,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-05 16:45:10,356 INFO L396 AbstractCegarLoop]: === Iteration 59 === 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:10,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:10,356 INFO L85 PathProgramCache]: Analyzing trace with hash 99877740, now seen corresponding path program 1 times [2025-02-05 16:45:10,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:10,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064567888] [2025-02-05 16:45:10,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:10,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:10,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:10,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:10,529 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:10,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064567888] [2025-02-05 16:45:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064567888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:10,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:10,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287738712] [2025-02-05 16:45:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:10,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:10,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:10,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:10,530 INFO L87 Difference]: Start difference. First operand 925 states and 1206 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:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:11,433 INFO L93 Difference]: Finished difference Result 1487 states and 1967 transitions. [2025-02-05 16:45:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:11,433 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:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:11,435 INFO L225 Difference]: With dead ends: 1487 [2025-02-05 16:45:11,435 INFO L226 Difference]: Without dead ends: 1339 [2025-02-05 16:45:11,435 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:11,436 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 2698 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:11,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 2932 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-02-05 16:45:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 925. [2025-02-05 16:45:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.334440753045404) internal successors, (1205), 924 states have internal predecessors, (1205), 0 states have call successors, (0), 0 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,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1205 transitions. [2025-02-05 16:45:11,442 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1205 transitions. Word has length 96 [2025-02-05 16:45:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:11,442 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1205 transitions. [2025-02-05 16:45:11,443 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:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1205 transitions. [2025-02-05 16:45:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:11,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:11,443 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:11,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-05 16:45:11,444 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:45:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2128461127, now seen corresponding path program 1 times [2025-02-05 16:45:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026378925] [2025-02-05 16:45:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:11,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:11,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:11,609 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,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:11,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026378925] [2025-02-05 16:45:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026378925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:11,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:11,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725099138] [2025-02-05 16:45:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:11,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:11,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:11,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:11,611 INFO L87 Difference]: Start difference. First operand 925 states and 1205 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:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:12,342 INFO L93 Difference]: Finished difference Result 1487 states and 1965 transitions. [2025-02-05 16:45:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:12,342 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:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:12,344 INFO L225 Difference]: With dead ends: 1487 [2025-02-05 16:45:12,344 INFO L226 Difference]: Without dead ends: 1339 [2025-02-05 16:45:12,344 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:12,344 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 3526 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3526 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:12,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3526 Valid, 2275 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-02-05 16:45:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 925. [2025-02-05 16:45:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 903 states have (on average 1.3333333333333333) internal successors, (1204), 924 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1204 transitions. [2025-02-05 16:45:12,354 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1204 transitions. Word has length 96 [2025-02-05 16:45:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:12,354 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1204 transitions. [2025-02-05 16:45:12,354 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:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1204 transitions. [2025-02-05 16:45:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:12,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:12,355 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:45:12,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-05 16:45:12,355 INFO L396 AbstractCegarLoop]: === Iteration 61 === 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:12,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 574406174, now seen corresponding path program 1 times [2025-02-05 16:45:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142725970] [2025-02-05 16:45:12,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:12,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:12,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:12,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:12,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:12,542 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:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142725970] [2025-02-05 16:45:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142725970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:12,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:12,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:12,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362486625] [2025-02-05 16:45:12,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:12,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:12,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:12,543 INFO L87 Difference]: Start difference. First operand 925 states and 1204 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:45:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:13,202 INFO L93 Difference]: Finished difference Result 1344 states and 1745 transitions. [2025-02-05 16:45:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:13,202 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:45:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:13,203 INFO L225 Difference]: With dead ends: 1344 [2025-02-05 16:45:13,203 INFO L226 Difference]: Without dead ends: 1339 [2025-02-05 16:45:13,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:45:13,204 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 3914 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3914 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:13,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3914 Valid, 2281 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:45:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-02-05 16:45:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 917. [2025-02-05 16:45:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 895 states have (on average 1.3340782122905028) internal successors, (1194), 916 states have internal predecessors, (1194), 0 states have call successors, (0), 0 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,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1194 transitions. [2025-02-05 16:45:13,211 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1194 transitions. Word has length 97 [2025-02-05 16:45:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:13,211 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1194 transitions. [2025-02-05 16:45:13,211 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:45:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1194 transitions. [2025-02-05 16:45:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:13,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:13,212 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:45:13,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-05 16:45:13,212 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:45:13,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2144208921, now seen corresponding path program 1 times [2025-02-05 16:45:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:13,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464192453] [2025-02-05 16:45:13,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:13,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:13,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:13,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:13,377 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,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464192453] [2025-02-05 16:45:13,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464192453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:13,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:13,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554902642] [2025-02-05 16:45:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:13,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:13,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:13,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:13,378 INFO L87 Difference]: Start difference. First operand 917 states and 1194 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:45:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:13,993 INFO L93 Difference]: Finished difference Result 1485 states and 1959 transitions. [2025-02-05 16:45:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:13,993 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:45:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:13,995 INFO L225 Difference]: With dead ends: 1485 [2025-02-05 16:45:13,995 INFO L226 Difference]: Without dead ends: 1337 [2025-02-05 16:45:13,995 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:13,995 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 1994 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 2292 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:13,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 2292 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:45:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2025-02-05 16:45:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 915. [2025-02-05 16:45:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 893 states have (on average 1.3325867861142218) internal successors, (1190), 914 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1190 transitions. [2025-02-05 16:45:14,002 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1190 transitions. Word has length 97 [2025-02-05 16:45:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:14,002 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1190 transitions. [2025-02-05 16:45:14,002 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:45:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1190 transitions. [2025-02-05 16:45:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:14,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:14,003 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:45:14,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-05 16:45:14,003 INFO L396 AbstractCegarLoop]: === Iteration 63 === 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:14,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 846751897, now seen corresponding path program 1 times [2025-02-05 16:45:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499632286] [2025-02-05 16:45:14,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:14,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:14,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:14,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:14,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:14,142 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,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499632286] [2025-02-05 16:45:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499632286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:14,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372752316] [2025-02-05 16:45:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:14,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:14,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:14,143 INFO L87 Difference]: Start difference. First operand 915 states and 1190 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:45:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:14,851 INFO L93 Difference]: Finished difference Result 1488 states and 1960 transitions. [2025-02-05 16:45:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:14,851 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:45:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:14,852 INFO L225 Difference]: With dead ends: 1488 [2025-02-05 16:45:14,852 INFO L226 Difference]: Without dead ends: 1337 [2025-02-05 16:45:14,853 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:14,853 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2943 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2943 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:14,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2943 Valid, 2297 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2025-02-05 16:45:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 911. [2025-02-05 16:45:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 889 states have (on average 1.3329583802024747) internal successors, (1185), 910 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1185 transitions. [2025-02-05 16:45:14,860 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1185 transitions. Word has length 97 [2025-02-05 16:45:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:14,860 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1185 transitions. [2025-02-05 16:45:14,860 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:45:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1185 transitions. [2025-02-05 16:45:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:14,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:14,861 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:45:14,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-05 16:45:14,862 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:45:14,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:14,862 INFO L85 PathProgramCache]: Analyzing trace with hash 476420196, now seen corresponding path program 1 times [2025-02-05 16:45:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667516660] [2025-02-05 16:45:14,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:14,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:14,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:14,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:14,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:15,036 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,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:15,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667516660] [2025-02-05 16:45:15,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667516660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:15,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:15,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:15,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561200800] [2025-02-05 16:45:15,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:15,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:15,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:15,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:15,042 INFO L87 Difference]: Start difference. First operand 911 states and 1185 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:45:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:15,821 INFO L93 Difference]: Finished difference Result 1483 states and 1954 transitions. [2025-02-05 16:45:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:15,821 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:45:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:15,823 INFO L225 Difference]: With dead ends: 1483 [2025-02-05 16:45:15,823 INFO L226 Difference]: Without dead ends: 1337 [2025-02-05 16:45:15,823 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:15,823 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 3883 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3883 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:15,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3883 Valid, 2308 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2025-02-05 16:45:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 911. [2025-02-05 16:45:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 889 states have (on average 1.3318335208098988) internal successors, (1184), 910 states have internal predecessors, (1184), 0 states have call successors, (0), 0 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,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1184 transitions. [2025-02-05 16:45:15,837 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1184 transitions. Word has length 97 [2025-02-05 16:45:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:15,837 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1184 transitions. [2025-02-05 16:45:15,837 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:45:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1184 transitions. [2025-02-05 16:45:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:15,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:15,838 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:45:15,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-05 16:45:15,838 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:45:15,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash 595347058, now seen corresponding path program 1 times [2025-02-05 16:45:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443616526] [2025-02-05 16:45:15,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:15,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:15,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:15,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:15,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:16,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:16,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:16,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443616526] [2025-02-05 16:45:16,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443616526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:16,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804452790] [2025-02-05 16:45:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:16,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:16,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:16,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:16,011 INFO L87 Difference]: Start difference. First operand 911 states and 1184 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:45:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:16,857 INFO L93 Difference]: Finished difference Result 1535 states and 2033 transitions. [2025-02-05 16:45:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:16,857 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:45:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:16,863 INFO L225 Difference]: With dead ends: 1535 [2025-02-05 16:45:16,863 INFO L226 Difference]: Without dead ends: 1377 [2025-02-05 16:45:16,863 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:16,864 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 2623 mSDsluCounter, 2266 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2623 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:16,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2623 Valid, 2892 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-02-05 16:45:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 907. [2025-02-05 16:45:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 885 states have (on average 1.3322033898305086) internal successors, (1179), 906 states have internal predecessors, (1179), 0 states have call successors, (0), 0 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,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1179 transitions. [2025-02-05 16:45:16,878 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1179 transitions. Word has length 97 [2025-02-05 16:45:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:16,878 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1179 transitions. [2025-02-05 16:45:16,878 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:45:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1179 transitions. [2025-02-05 16:45:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:16,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:16,882 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:45:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-05 16:45:16,882 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:45:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1769840326, now seen corresponding path program 1 times [2025-02-05 16:45:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446100191] [2025-02-05 16:45:16,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:16,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:16,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:16,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:16,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:17,038 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,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446100191] [2025-02-05 16:45:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446100191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:17,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330413861] [2025-02-05 16:45:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:17,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:17,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:17,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:17,040 INFO L87 Difference]: Start difference. First operand 907 states and 1179 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:45:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:17,831 INFO L93 Difference]: Finished difference Result 1479 states and 1948 transitions. [2025-02-05 16:45:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:17,831 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:45:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:17,833 INFO L225 Difference]: With dead ends: 1479 [2025-02-05 16:45:17,833 INFO L226 Difference]: Without dead ends: 1332 [2025-02-05 16:45:17,833 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:17,840 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 3791 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:17,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3791 Valid, 2392 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:45:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-02-05 16:45:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 906. [2025-02-05 16:45:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 884 states have (on average 1.331447963800905) internal successors, (1177), 905 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1177 transitions. [2025-02-05 16:45:17,852 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1177 transitions. Word has length 97 [2025-02-05 16:45:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:17,852 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1177 transitions. [2025-02-05 16:45:17,855 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:45:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1177 transitions. [2025-02-05 16:45:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:17,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:17,856 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:45:17,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-05 16:45:17,857 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:45:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1992876172, now seen corresponding path program 1 times [2025-02-05 16:45:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:17,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767975458] [2025-02-05 16:45:17,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:17,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:17,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:17,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:17,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:18,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767975458] [2025-02-05 16:45:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767975458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:18,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:18,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:18,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513229768] [2025-02-05 16:45:18,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:18,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:18,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:18,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:18,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:18,057 INFO L87 Difference]: Start difference. First operand 906 states and 1177 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:45:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:18,787 INFO L93 Difference]: Finished difference Result 1534 states and 2029 transitions. [2025-02-05 16:45:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:18,787 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:45:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:18,789 INFO L225 Difference]: With dead ends: 1534 [2025-02-05 16:45:18,789 INFO L226 Difference]: Without dead ends: 1376 [2025-02-05 16:45:18,790 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:18,790 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 3558 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3558 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:18,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3558 Valid, 2676 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-02-05 16:45:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 902. [2025-02-05 16:45:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 880 states have (on average 1.3318181818181818) internal successors, (1172), 901 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1172 transitions. [2025-02-05 16:45:18,798 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1172 transitions. Word has length 97 [2025-02-05 16:45:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1172 transitions. [2025-02-05 16:45:18,798 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:45:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1172 transitions. [2025-02-05 16:45:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:45:18,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:18,799 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:45:18,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-02-05 16:45:18,799 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:45:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2111857312, now seen corresponding path program 1 times [2025-02-05 16:45:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:18,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667675321] [2025-02-05 16:45:18,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:18,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:18,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:45:18,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:45:18,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:18,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:18,936 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:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667675321] [2025-02-05 16:45:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667675321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:18,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:18,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490900572] [2025-02-05 16:45:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:18,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:18,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:18,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:18,937 INFO L87 Difference]: Start difference. First operand 902 states and 1172 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)