./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-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 6c698c3a474f0bb431ef6e81ac39d288198716f9950dc2b1ea90a04cccf08b06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:53:50,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:53:50,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:53:50,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:53:50,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:53:50,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:53:50,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:53:50,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:53:50,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:53:50,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:53:50,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:53:50,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:53:50,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:53:50,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:53:50,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:53:50,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:53:50,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:53:50,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:53:50,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:53:50,943 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 -> 6c698c3a474f0bb431ef6e81ac39d288198716f9950dc2b1ea90a04cccf08b06 [2025-01-09 04:53:51,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:53:51,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:53:51,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:53:51,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:53:51,163 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:53:51,164 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-01-09 04:53:52,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a8dd43f5/7228a0277ff04a01bce29e10362418e7/FLAG975dd170e [2025-01-09 04:53:52,766 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:53:52,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-01-09 04:53:52,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a8dd43f5/7228a0277ff04a01bce29e10362418e7/FLAG975dd170e [2025-01-09 04:53:52,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a8dd43f5/7228a0277ff04a01bce29e10362418e7 [2025-01-09 04:53:52,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:53:52,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:53:52,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:53:52,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:53:52,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:53:52,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:53:52" (1/1) ... [2025-01-09 04:53:52,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fc2296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:52, skipping insertion in model container [2025-01-09 04:53:52,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:53:52" (1/1) ... [2025-01-09 04:53:52,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:53:53,287 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2025-01-09 04:53:53,310 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2025-01-09 04:53:53,317 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2025-01-09 04:53:53,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2025-01-09 04:53:53,328 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2025-01-09 04:53:53,331 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2025-01-09 04:53:53,335 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2025-01-09 04:53:53,343 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2025-01-09 04:53:53,346 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2025-01-09 04:53:53,350 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2025-01-09 04:53:53,356 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2025-01-09 04:53:53,370 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2025-01-09 04:53:53,373 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2025-01-09 04:53:53,379 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2025-01-09 04:53:53,388 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2025-01-09 04:53:53,396 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2025-01-09 04:53:53,411 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2025-01-09 04:53:53,414 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2025-01-09 04:53:53,417 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2025-01-09 04:53:53,422 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2025-01-09 04:53:53,435 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2025-01-09 04:53:53,454 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2025-01-09 04:53:53,488 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2025-01-09 04:53:53,491 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2025-01-09 04:53:53,494 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2025-01-09 04:53:53,499 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2025-01-09 04:53:53,508 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2025-01-09 04:53:53,521 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2025-01-09 04:53:53,543 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2025-01-09 04:53:53,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:53:53,933 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:53:54,025 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2025-01-09 04:53:54,049 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2025-01-09 04:53:54,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2025-01-09 04:53:54,064 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2025-01-09 04:53:54,074 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2025-01-09 04:53:54,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2025-01-09 04:53:54,089 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2025-01-09 04:53:54,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2025-01-09 04:53:54,099 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2025-01-09 04:53:54,102 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2025-01-09 04:53:54,106 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2025-01-09 04:53:54,114 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2025-01-09 04:53:54,116 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2025-01-09 04:53:54,119 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2025-01-09 04:53:54,123 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2025-01-09 04:53:54,130 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2025-01-09 04:53:54,140 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2025-01-09 04:53:54,143 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2025-01-09 04:53:54,147 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2025-01-09 04:53:54,151 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2025-01-09 04:53:54,159 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2025-01-09 04:53:54,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2025-01-09 04:53:54,195 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2025-01-09 04:53:54,198 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2025-01-09 04:53:54,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2025-01-09 04:53:54,206 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2025-01-09 04:53:54,213 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2025-01-09 04:53:54,223 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2025-01-09 04:53:54,242 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2025-01-09 04:53:54,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:53:54,583 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:53:54,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54 WrapperNode [2025-01-09 04:53:54,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:53:54,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:53:54,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:53:54,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:53:54,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:54,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:54,815 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13514 [2025-01-09 04:53:54,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:53:54,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:53:54,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:53:54,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:53:54,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:54,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:54,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:54,926 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-01-09 04:53:54,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:54,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:55,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:55,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:55,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:55,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:55,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:55,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:53:55,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:53:55,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:53:55,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:53:55,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (1/1) ... [2025-01-09 04:53:55,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:53:55,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:53:55,174 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-01-09 04:53:55,176 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-01-09 04:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:53:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:53:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:53:55,516 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:53:55,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:53:59,863 INFO L? ?]: Removed 2124 outVars from TransFormulas that were not future-live. [2025-01-09 04:53:59,863 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:53:59,910 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:53:59,910 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:53:59,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:53:59 BoogieIcfgContainer [2025-01-09 04:53:59,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:53:59,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:53:59,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:53:59,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:53:59,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:53:52" (1/3) ... [2025-01-09 04:53:59,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b73f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:53:59, skipping insertion in model container [2025-01-09 04:53:59,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:53:54" (2/3) ... [2025-01-09 04:53:59,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b73f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:53:59, skipping insertion in model container [2025-01-09 04:53:59,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:53:59" (3/3) ... [2025-01-09 04:53:59,922 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-01-09 04:53:59,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:53:59,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c that has 1 procedures, 2082 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-01-09 04:54:00,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:54:00,041 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;@423d85ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:54:00,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 04:54:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:54:00,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:00,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:00,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:00,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1477171740, now seen corresponding path program 1 times [2025-01-09 04:54:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:00,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700501004] [2025-01-09 04:54:00,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:00,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:54:00,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:54:00,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:00,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700501004] [2025-01-09 04:54:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700501004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176474469] [2025-01-09 04:54:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:00,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:00,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:00,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:00,708 INFO L87 Difference]: Start difference. First operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 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 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:02,090 INFO L93 Difference]: Finished difference Result 3681 states and 6458 transitions. [2025-01-09 04:54:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:02,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-01-09 04:54:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:02,116 INFO L225 Difference]: With dead ends: 3681 [2025-01-09 04:54:02,116 INFO L226 Difference]: Without dead ends: 2156 [2025-01-09 04:54:02,124 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-01-09 04:54:02,126 INFO L435 NwaCegarLoop]: 1861 mSDtfsCounter, 10122 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10122 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:02,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10122 Valid, 2458 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2025-01-09 04:54:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2054. [2025-01-09 04:54:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2025 states have (on average 1.3688888888888888) internal successors, (2772), 2053 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2772 transitions. [2025-01-09 04:54:02,263 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2772 transitions. Word has length 101 [2025-01-09 04:54:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:02,264 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2772 transitions. [2025-01-09 04:54:02,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2772 transitions. [2025-01-09 04:54:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:54:02,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:02,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:02,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:54:02,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:02,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 951904542, now seen corresponding path program 1 times [2025-01-09 04:54:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:02,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399758345] [2025-01-09 04:54:02,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:02,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:54:02,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:54:02,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:02,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:02,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:02,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399758345] [2025-01-09 04:54:02,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399758345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:02,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:02,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:02,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192924344] [2025-01-09 04:54:02,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:02,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:02,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:02,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:02,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:02,500 INFO L87 Difference]: Start difference. First operand 2054 states and 2772 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:03,194 INFO L93 Difference]: Finished difference Result 3542 states and 4915 transitions. [2025-01-09 04:54:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:03,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-09 04:54:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:03,205 INFO L225 Difference]: With dead ends: 3542 [2025-01-09 04:54:03,205 INFO L226 Difference]: Without dead ends: 1822 [2025-01-09 04:54:03,206 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-01-09 04:54:03,207 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 5219 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5219 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:03,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5219 Valid, 1010 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:54:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2025-01-09 04:54:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2025-01-09 04:54:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1793 states have (on average 1.3976575571667595) internal successors, (2506), 1821 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2506 transitions. [2025-01-09 04:54:03,243 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2506 transitions. Word has length 102 [2025-01-09 04:54:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:03,244 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2506 transitions. [2025-01-09 04:54:03,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2506 transitions. [2025-01-09 04:54:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:54:03,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:03,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:03,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:54:03,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash -873201018, now seen corresponding path program 1 times [2025-01-09 04:54:03,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:03,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050912483] [2025-01-09 04:54:03,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:03,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:54:03,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:54:03,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:03,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050912483] [2025-01-09 04:54:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050912483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103900165] [2025-01-09 04:54:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:03,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:03,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:03,394 INFO L87 Difference]: Start difference. First operand 1822 states and 2506 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:04,180 INFO L93 Difference]: Finished difference Result 3310 states and 4647 transitions. [2025-01-09 04:54:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:04,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:54:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:04,186 INFO L225 Difference]: With dead ends: 3310 [2025-01-09 04:54:04,186 INFO L226 Difference]: Without dead ends: 1742 [2025-01-09 04:54:04,187 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-01-09 04:54:04,188 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 4860 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4860 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:04,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4860 Valid, 774 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:54:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-01-09 04:54:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2025-01-09 04:54:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1713 states have (on average 1.4057209573847051) internal successors, (2408), 1741 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2408 transitions. [2025-01-09 04:54:04,208 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2408 transitions. Word has length 103 [2025-01-09 04:54:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 1742 states and 2408 transitions. [2025-01-09 04:54:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2408 transitions. [2025-01-09 04:54:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:54:04,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:04,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:04,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:54:04,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1608818971, now seen corresponding path program 1 times [2025-01-09 04:54:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511137377] [2025-01-09 04:54:04,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:04,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:54:04,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:54:04,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:04,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:04,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511137377] [2025-01-09 04:54:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511137377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:04,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170926416] [2025-01-09 04:54:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:04,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:04,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:04,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:04,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:04,404 INFO L87 Difference]: Start difference. First operand 1742 states and 2408 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:04,921 INFO L93 Difference]: Finished difference Result 3230 states and 4547 transitions. [2025-01-09 04:54:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:04,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 04:54:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:04,926 INFO L225 Difference]: With dead ends: 3230 [2025-01-09 04:54:04,926 INFO L226 Difference]: Without dead ends: 1654 [2025-01-09 04:54:04,928 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-01-09 04:54:04,929 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4655 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:04,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 890 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:54:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-01-09 04:54:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1654. [2025-01-09 04:54:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1625 states have (on average 1.4215384615384616) internal successors, (2310), 1653 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2310 transitions. [2025-01-09 04:54:04,951 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2310 transitions. Word has length 104 [2025-01-09 04:54:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:04,951 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2310 transitions. [2025-01-09 04:54:04,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2310 transitions. [2025-01-09 04:54:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:54:04,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:04,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:04,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:54:04,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:04,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1915103433, now seen corresponding path program 1 times [2025-01-09 04:54:04,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:04,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318356666] [2025-01-09 04:54:04,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:04,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:04,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:54:04,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:54:04,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:04,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:05,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318356666] [2025-01-09 04:54:05,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318356666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:05,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:05,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256257957] [2025-01-09 04:54:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:05,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:05,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:05,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:05,090 INFO L87 Difference]: Start difference. First operand 1654 states and 2310 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:05,543 INFO L93 Difference]: Finished difference Result 3142 states and 4447 transitions. [2025-01-09 04:54:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:54:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:05,547 INFO L225 Difference]: With dead ends: 3142 [2025-01-09 04:54:05,547 INFO L226 Difference]: Without dead ends: 1601 [2025-01-09 04:54:05,549 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-01-09 04:54:05,549 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 4507 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:05,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 861 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:54:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-01-09 04:54:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-01-09 04:54:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1572 states have (on average 1.4319338422391859) internal successors, (2251), 1600 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2251 transitions. [2025-01-09 04:54:05,570 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2251 transitions. Word has length 105 [2025-01-09 04:54:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:05,571 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2251 transitions. [2025-01-09 04:54:05,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2251 transitions. [2025-01-09 04:54:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:54:05,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:05,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:05,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:54:05,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:05,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash -578368317, now seen corresponding path program 1 times [2025-01-09 04:54:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:05,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308356375] [2025-01-09 04:54:05,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:05,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:05,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:54:05,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:54:05,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:05,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308356375] [2025-01-09 04:54:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308356375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670012272] [2025-01-09 04:54:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:05,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:05,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:05,718 INFO L87 Difference]: Start difference. First operand 1601 states and 2251 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:06,273 INFO L93 Difference]: Finished difference Result 3089 states and 4386 transitions. [2025-01-09 04:54:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-01-09 04:54:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:06,277 INFO L225 Difference]: With dead ends: 3089 [2025-01-09 04:54:06,277 INFO L226 Difference]: Without dead ends: 1576 [2025-01-09 04:54:06,279 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-01-09 04:54:06,279 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 4410 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:06,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 848 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:54:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-01-09 04:54:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2025-01-09 04:54:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.436328377504848) internal successors, (2222), 1575 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2222 transitions. [2025-01-09 04:54:06,297 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2222 transitions. Word has length 106 [2025-01-09 04:54:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:06,297 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2222 transitions. [2025-01-09 04:54:06,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2222 transitions. [2025-01-09 04:54:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:54:06,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:06,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:06,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:54:06,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1323333204, now seen corresponding path program 1 times [2025-01-09 04:54:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286378945] [2025-01-09 04:54:06,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:06,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:54:06,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:54:06,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:06,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:06,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:06,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286378945] [2025-01-09 04:54:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286378945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:06,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:54:06,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260457993] [2025-01-09 04:54:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:06,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:54:06,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:06,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:54:06,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:54:06,430 INFO L87 Difference]: Start difference. First operand 1576 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:07,011 INFO L93 Difference]: Finished difference Result 3064 states and 4355 transitions. [2025-01-09 04:54:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:54:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-01-09 04:54:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:07,016 INFO L225 Difference]: With dead ends: 3064 [2025-01-09 04:54:07,016 INFO L226 Difference]: Without dead ends: 1568 [2025-01-09 04:54:07,017 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-01-09 04:54:07,018 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 4319 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:07,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 781 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:54:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-01-09 04:54:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2025-01-09 04:54:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4366471734892787) internal successors, (2211), 1567 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2211 transitions. [2025-01-09 04:54:07,033 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2211 transitions. Word has length 107 [2025-01-09 04:54:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:07,034 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2211 transitions. [2025-01-09 04:54:07,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2211 transitions. [2025-01-09 04:54:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:54:07,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:07,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:07,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:54:07,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:07,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 65664385, now seen corresponding path program 1 times [2025-01-09 04:54:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544320696] [2025-01-09 04:54:07,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:07,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:54:07,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:54:07,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:07,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:07,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544320696] [2025-01-09 04:54:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544320696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:07,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:07,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:54:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896661435] [2025-01-09 04:54:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:07,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:54:07,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:07,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:54:07,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:54:07,477 INFO L87 Difference]: Start difference. First operand 1568 states and 2211 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:08,866 INFO L93 Difference]: Finished difference Result 2720 states and 3700 transitions. [2025-01-09 04:54:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:54:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-01-09 04:54:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:08,872 INFO L225 Difference]: With dead ends: 2720 [2025-01-09 04:54:08,872 INFO L226 Difference]: Without dead ends: 2051 [2025-01-09 04:54:08,873 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-01-09 04:54:08,873 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 5978 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5978 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:08,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5978 Valid, 2807 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:54:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-01-09 04:54:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1568. [2025-01-09 04:54:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4359974009096816) internal successors, (2210), 1567 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2210 transitions. [2025-01-09 04:54:08,892 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2210 transitions. Word has length 108 [2025-01-09 04:54:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:08,893 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2210 transitions. [2025-01-09 04:54:08,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2210 transitions. [2025-01-09 04:54:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:54:08,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:08,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:08,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:54:08,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:08,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1618229889, now seen corresponding path program 1 times [2025-01-09 04:54:08,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:08,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081697703] [2025-01-09 04:54:08,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:08,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:54:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:54:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:09,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-01-09 04:54:09,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081697703] [2025-01-09 04:54:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081697703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:09,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:09,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438442179] [2025-01-09 04:54:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:09,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:09,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:09,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:09,160 INFO L87 Difference]: Start difference. First operand 1568 states and 2210 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:10,421 INFO L93 Difference]: Finished difference Result 2592 states and 3650 transitions. [2025-01-09 04:54:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:10,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-01-09 04:54:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:10,426 INFO L225 Difference]: With dead ends: 2592 [2025-01-09 04:54:10,426 INFO L226 Difference]: Without dead ends: 2397 [2025-01-09 04:54:10,427 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-01-09 04:54:10,427 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 6085 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6085 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:10,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6085 Valid, 3564 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2950 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-01-09 04:54:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-01-09 04:54:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4353476283300846) internal successors, (2209), 1567 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2209 transitions. [2025-01-09 04:54:10,446 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2209 transitions. Word has length 108 [2025-01-09 04:54:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:10,446 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2209 transitions. [2025-01-09 04:54:10,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2209 transitions. [2025-01-09 04:54:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:54:10,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:10,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:10,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:54:10,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:10,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash 180174419, now seen corresponding path program 1 times [2025-01-09 04:54:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:10,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779330263] [2025-01-09 04:54:10,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:10,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:10,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:54:10,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:54:10,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:10,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:10,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:10,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779330263] [2025-01-09 04:54:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779330263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:10,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:54:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44312629] [2025-01-09 04:54:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:10,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:54:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:10,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:54:10,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:54:10,810 INFO L87 Difference]: Start difference. First operand 1568 states and 2209 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:12,329 INFO L93 Difference]: Finished difference Result 2629 states and 3697 transitions. [2025-01-09 04:54:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:54:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-01-09 04:54:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:12,334 INFO L225 Difference]: With dead ends: 2629 [2025-01-09 04:54:12,334 INFO L226 Difference]: Without dead ends: 2434 [2025-01-09 04:54:12,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:54:12,335 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 8398 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 4083 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8398 SdHoareTripleChecker+Valid, 4795 SdHoareTripleChecker+Invalid, 4096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:12,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8398 Valid, 4795 Invalid, 4096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4083 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:54:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-01-09 04:54:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 1581. [2025-01-09 04:54:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1552 states have (on average 1.4355670103092784) internal successors, (2228), 1580 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2228 transitions. [2025-01-09 04:54:12,354 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2228 transitions. Word has length 108 [2025-01-09 04:54:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:12,354 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2228 transitions. [2025-01-09 04:54:12,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2228 transitions. [2025-01-09 04:54:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:54:12,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:12,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:12,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:54:12,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:12,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:12,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1822156941, now seen corresponding path program 1 times [2025-01-09 04:54:12,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:12,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289774899] [2025-01-09 04:54:12,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:12,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:54:12,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:54:12,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:12,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289774899] [2025-01-09 04:54:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289774899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183832668] [2025-01-09 04:54:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:12,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:12,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:12,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:12,668 INFO L87 Difference]: Start difference. First operand 1581 states and 2228 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:13,891 INFO L93 Difference]: Finished difference Result 2050 states and 2904 transitions. [2025-01-09 04:54:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-01-09 04:54:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:13,895 INFO L225 Difference]: With dead ends: 2050 [2025-01-09 04:54:13,895 INFO L226 Difference]: Without dead ends: 1658 [2025-01-09 04:54:13,896 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-01-09 04:54:13,896 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 4070 mSDsluCounter, 3734 mSDsCounter, 0 mSdLazyCounter, 3682 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4070 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:13,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4070 Valid, 4561 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3682 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-01-09 04:54:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1568. [2025-01-09 04:54:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4346978557504872) internal successors, (2208), 1567 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2208 transitions. [2025-01-09 04:54:13,913 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2208 transitions. Word has length 108 [2025-01-09 04:54:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:13,913 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2208 transitions. [2025-01-09 04:54:13,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2208 transitions. [2025-01-09 04:54:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:54:13,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:13,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:54:13,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:13,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash -860352434, now seen corresponding path program 1 times [2025-01-09 04:54:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182535498] [2025-01-09 04:54:13,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:13,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:54:13,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:54:13,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:13,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182535498] [2025-01-09 04:54:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182535498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505420856] [2025-01-09 04:54:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:14,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:14,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:14,166 INFO L87 Difference]: Start difference. First operand 1568 states and 2208 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:15,440 INFO L93 Difference]: Finished difference Result 2641 states and 3727 transitions. [2025-01-09 04:54:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:15,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 04:54:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:15,445 INFO L225 Difference]: With dead ends: 2641 [2025-01-09 04:54:15,445 INFO L226 Difference]: Without dead ends: 2421 [2025-01-09 04:54:15,446 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-01-09 04:54:15,446 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 3829 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3829 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:15,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3829 Valid, 3626 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-01-09 04:54:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-01-09 04:54:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4340480831708902) internal successors, (2207), 1567 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2207 transitions. [2025-01-09 04:54:15,469 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2207 transitions. Word has length 110 [2025-01-09 04:54:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:15,469 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2207 transitions. [2025-01-09 04:54:15,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2207 transitions. [2025-01-09 04:54:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:54:15,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:15,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:15,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:54:15,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:15,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1432283502, now seen corresponding path program 1 times [2025-01-09 04:54:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:15,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861770704] [2025-01-09 04:54:15,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:15,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:15,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:54:15,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:54:15,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:15,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:15,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:15,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861770704] [2025-01-09 04:54:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861770704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:54:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334024299] [2025-01-09 04:54:15,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:15,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:54:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:54:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:54:15,890 INFO L87 Difference]: Start difference. First operand 1568 states and 2207 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:17,994 INFO L93 Difference]: Finished difference Result 3486 states and 4963 transitions. [2025-01-09 04:54:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:54:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 04:54:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:18,001 INFO L225 Difference]: With dead ends: 3486 [2025-01-09 04:54:18,002 INFO L226 Difference]: Without dead ends: 3197 [2025-01-09 04:54:18,003 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-01-09 04:54:18,003 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 13124 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13124 SdHoareTripleChecker+Valid, 5479 SdHoareTripleChecker+Invalid, 4838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 4475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:18,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13124 Valid, 5479 Invalid, 4838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 4475 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:54:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-01-09 04:54:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 1572. [2025-01-09 04:54:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4329228775113416) internal successors, (2211), 1571 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2211 transitions. [2025-01-09 04:54:18,030 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2211 transitions. Word has length 110 [2025-01-09 04:54:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:18,030 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2211 transitions. [2025-01-09 04:54:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2211 transitions. [2025-01-09 04:54:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:54:18,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:18,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:18,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:54:18,033 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash 237293966, now seen corresponding path program 1 times [2025-01-09 04:54:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:18,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810510739] [2025-01-09 04:54:18,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:18,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:54:18,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:54:18,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:18,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:18,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810510739] [2025-01-09 04:54:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810510739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:18,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:18,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747817819] [2025-01-09 04:54:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:18,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:18,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:18,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:18,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:18,282 INFO L87 Difference]: Start difference. First operand 1572 states and 2211 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:19,480 INFO L93 Difference]: Finished difference Result 2638 states and 3723 transitions. [2025-01-09 04:54:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:19,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 04:54:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:19,484 INFO L225 Difference]: With dead ends: 2638 [2025-01-09 04:54:19,484 INFO L226 Difference]: Without dead ends: 2425 [2025-01-09 04:54:19,485 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-01-09 04:54:19,485 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 6725 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 2944 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6725 SdHoareTripleChecker+Valid, 3632 SdHoareTripleChecker+Invalid, 2951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:19,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6725 Valid, 3632 Invalid, 2951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2944 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2025-01-09 04:54:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1572. [2025-01-09 04:54:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4322747893713546) internal successors, (2210), 1571 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2210 transitions. [2025-01-09 04:54:19,500 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2210 transitions. Word has length 110 [2025-01-09 04:54:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:19,501 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2210 transitions. [2025-01-09 04:54:19,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2210 transitions. [2025-01-09 04:54:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:54:19,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:19,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:19,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:54:19,503 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:19,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash -212001511, now seen corresponding path program 1 times [2025-01-09 04:54:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:19,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482435120] [2025-01-09 04:54:19,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:19,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:54:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:54:19,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:19,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482435120] [2025-01-09 04:54:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482435120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:19,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783972231] [2025-01-09 04:54:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:19,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:19,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:19,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:19,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:19,783 INFO L87 Difference]: Start difference. First operand 1572 states and 2210 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:21,034 INFO L93 Difference]: Finished difference Result 2721 states and 3847 transitions. [2025-01-09 04:54:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 04:54:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:21,038 INFO L225 Difference]: With dead ends: 2721 [2025-01-09 04:54:21,038 INFO L226 Difference]: Without dead ends: 2453 [2025-01-09 04:54:21,039 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-01-09 04:54:21,040 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 7919 mSDsluCounter, 3094 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7919 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:21,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7919 Valid, 4006 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-01-09 04:54:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1572. [2025-01-09 04:54:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4316267012313675) internal successors, (2209), 1571 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2209 transitions. [2025-01-09 04:54:21,054 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2209 transitions. Word has length 110 [2025-01-09 04:54:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:21,055 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2209 transitions. [2025-01-09 04:54:21,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2209 transitions. [2025-01-09 04:54:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:54:21,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:21,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:21,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:54:21,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:21,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1993529301, now seen corresponding path program 1 times [2025-01-09 04:54:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971936207] [2025-01-09 04:54:21,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:21,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:54:21,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:54:21,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:21,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:21,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:21,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971936207] [2025-01-09 04:54:21,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971936207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:21,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:21,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:21,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096178628] [2025-01-09 04:54:21,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:21,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:21,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:21,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:21,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:21,324 INFO L87 Difference]: Start difference. First operand 1572 states and 2209 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:22,518 INFO L93 Difference]: Finished difference Result 2825 states and 3989 transitions. [2025-01-09 04:54:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 04:54:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:22,522 INFO L225 Difference]: With dead ends: 2825 [2025-01-09 04:54:22,522 INFO L226 Difference]: Without dead ends: 2453 [2025-01-09 04:54:22,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:54:22,523 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 7914 mSDsluCounter, 3094 mSDsCounter, 0 mSdLazyCounter, 3208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7914 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 3215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:22,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7914 Valid, 4006 Invalid, 3215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3208 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-01-09 04:54:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1572. [2025-01-09 04:54:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4303305249513933) internal successors, (2207), 1571 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2207 transitions. [2025-01-09 04:54:22,543 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2207 transitions. Word has length 110 [2025-01-09 04:54:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:22,544 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2207 transitions. [2025-01-09 04:54:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2207 transitions. [2025-01-09 04:54:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:54:22,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:22,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:22,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:54:22,546 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:22,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash 8802059, now seen corresponding path program 1 times [2025-01-09 04:54:22,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:22,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360300347] [2025-01-09 04:54:22,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:22,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:54:22,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:54:22,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:22,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:22,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:22,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360300347] [2025-01-09 04:54:22,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360300347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:22,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:22,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954772871] [2025-01-09 04:54:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:22,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:22,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:22,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:22,735 INFO L87 Difference]: Start difference. First operand 1572 states and 2207 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:23,891 INFO L93 Difference]: Finished difference Result 2615 states and 3674 transitions. [2025-01-09 04:54:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 04:54:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:23,895 INFO L225 Difference]: With dead ends: 2615 [2025-01-09 04:54:23,895 INFO L226 Difference]: Without dead ends: 2401 [2025-01-09 04:54:23,896 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-01-09 04:54:23,896 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 5738 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5738 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 3182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:23,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5738 Valid, 3856 Invalid, 3182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:54:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-01-09 04:54:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1572. [2025-01-09 04:54:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4290343486714192) internal successors, (2205), 1571 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2205 transitions. [2025-01-09 04:54:23,908 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2205 transitions. Word has length 110 [2025-01-09 04:54:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:23,908 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2205 transitions. [2025-01-09 04:54:23,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2205 transitions. [2025-01-09 04:54:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:54:23,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:23,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:23,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:54:23,910 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1694810938, now seen corresponding path program 1 times [2025-01-09 04:54:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:23,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217679230] [2025-01-09 04:54:23,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:54:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:54:23,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:23,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:24,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217679230] [2025-01-09 04:54:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217679230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149211723] [2025-01-09 04:54:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:24,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:24,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:24,123 INFO L87 Difference]: Start difference. First operand 1572 states and 2205 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:25,126 INFO L93 Difference]: Finished difference Result 2318 states and 3264 transitions. [2025-01-09 04:54:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:25,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-01-09 04:54:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:25,129 INFO L225 Difference]: With dead ends: 2318 [2025-01-09 04:54:25,129 INFO L226 Difference]: Without dead ends: 1662 [2025-01-09 04:54:25,129 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-01-09 04:54:25,130 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 4058 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 2944 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 2951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:25,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4058 Valid, 3654 Invalid, 2951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2944 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:54:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2025-01-09 04:54:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1572. [2025-01-09 04:54:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4277381723914453) internal successors, (2203), 1571 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2203 transitions. [2025-01-09 04:54:25,141 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2203 transitions. Word has length 110 [2025-01-09 04:54:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:25,141 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2203 transitions. [2025-01-09 04:54:25,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2203 transitions. [2025-01-09 04:54:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:54:25,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:25,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:25,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:54:25,143 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:25,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1235444325, now seen corresponding path program 1 times [2025-01-09 04:54:25,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:25,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034403504] [2025-01-09 04:54:25,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:25,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:54:25,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:54:25,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:25,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:25,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034403504] [2025-01-09 04:54:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034403504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:25,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712599121] [2025-01-09 04:54:25,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:25,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:25,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:25,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:25,322 INFO L87 Difference]: Start difference. First operand 1572 states and 2203 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:26,451 INFO L93 Difference]: Finished difference Result 2605 states and 3649 transitions. [2025-01-09 04:54:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-01-09 04:54:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:26,454 INFO L225 Difference]: With dead ends: 2605 [2025-01-09 04:54:26,454 INFO L226 Difference]: Without dead ends: 2401 [2025-01-09 04:54:26,455 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-01-09 04:54:26,455 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 5777 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5777 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:26,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5777 Valid, 3856 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:54:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-01-09 04:54:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1572. [2025-01-09 04:54:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4270900842514582) internal successors, (2202), 1571 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2202 transitions. [2025-01-09 04:54:26,468 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2202 transitions. Word has length 111 [2025-01-09 04:54:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:26,468 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2202 transitions. [2025-01-09 04:54:26,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2202 transitions. [2025-01-09 04:54:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:54:26,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:26,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:26,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:54:26,470 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:26,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1644289553, now seen corresponding path program 1 times [2025-01-09 04:54:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:26,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519306303] [2025-01-09 04:54:26,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:26,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:54:26,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:54:26,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:26,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519306303] [2025-01-09 04:54:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519306303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:26,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474423564] [2025-01-09 04:54:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:26,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:26,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:26,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:26,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:26,677 INFO L87 Difference]: Start difference. First operand 1572 states and 2202 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:28,030 INFO L93 Difference]: Finished difference Result 2742 states and 3859 transitions. [2025-01-09 04:54:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:28,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-01-09 04:54:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:28,034 INFO L225 Difference]: With dead ends: 2742 [2025-01-09 04:54:28,034 INFO L226 Difference]: Without dead ends: 2453 [2025-01-09 04:54:28,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:54:28,035 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 6046 mSDsluCounter, 4127 mSDsCounter, 0 mSdLazyCounter, 4272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6046 SdHoareTripleChecker+Valid, 5385 SdHoareTripleChecker+Invalid, 4278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:28,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6046 Valid, 5385 Invalid, 4278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4272 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-01-09 04:54:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1568. [2025-01-09 04:54:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4275503573749189) internal successors, (2197), 1567 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2197 transitions. [2025-01-09 04:54:28,049 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2197 transitions. Word has length 111 [2025-01-09 04:54:28,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:28,049 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2197 transitions. [2025-01-09 04:54:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2197 transitions. [2025-01-09 04:54:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:28,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:28,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:28,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:54:28,051 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:28,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash -380477278, now seen corresponding path program 1 times [2025-01-09 04:54:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749242847] [2025-01-09 04:54:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:28,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:28,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:28,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:28,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749242847] [2025-01-09 04:54:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749242847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:28,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953102170] [2025-01-09 04:54:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:28,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:28,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:28,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:28,345 INFO L87 Difference]: Start difference. First operand 1568 states and 2197 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:29,665 INFO L93 Difference]: Finished difference Result 2655 states and 3727 transitions. [2025-01-09 04:54:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:29,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:29,669 INFO L225 Difference]: With dead ends: 2655 [2025-01-09 04:54:29,669 INFO L226 Difference]: Without dead ends: 2421 [2025-01-09 04:54:29,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:54:29,670 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 5721 mSDsluCounter, 3684 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5721 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:29,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5721 Valid, 4801 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-01-09 04:54:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-01-09 04:54:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4269005847953216) internal successors, (2196), 1567 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2196 transitions. [2025-01-09 04:54:29,686 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2196 transitions. Word has length 112 [2025-01-09 04:54:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:29,686 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2196 transitions. [2025-01-09 04:54:29,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2196 transitions. [2025-01-09 04:54:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:29,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:29,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:54:29,688 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:29,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1907876888, now seen corresponding path program 1 times [2025-01-09 04:54:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437939503] [2025-01-09 04:54:29,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:29,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:29,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:29,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:29,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:29,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:29,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:29,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437939503] [2025-01-09 04:54:29,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437939503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:29,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435208572] [2025-01-09 04:54:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:29,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:29,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:29,869 INFO L87 Difference]: Start difference. First operand 1568 states and 2196 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:31,039 INFO L93 Difference]: Finished difference Result 2592 states and 3633 transitions. [2025-01-09 04:54:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:31,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:31,046 INFO L225 Difference]: With dead ends: 2592 [2025-01-09 04:54:31,046 INFO L226 Difference]: Without dead ends: 2397 [2025-01-09 04:54:31,047 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-01-09 04:54:31,049 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 7255 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7255 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:31,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7255 Valid, 4241 Invalid, 3485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-01-09 04:54:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-01-09 04:54:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4262508122157245) internal successors, (2195), 1567 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2195 transitions. [2025-01-09 04:54:31,089 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2195 transitions. Word has length 112 [2025-01-09 04:54:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2195 transitions. [2025-01-09 04:54:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2195 transitions. [2025-01-09 04:54:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:31,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:31,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:31,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:54:31,091 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 230381962, now seen corresponding path program 1 times [2025-01-09 04:54:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306808909] [2025-01-09 04:54:31,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:31,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:31,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:31,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:31,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:31,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:31,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306808909] [2025-01-09 04:54:31,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306808909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:31,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:31,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:54:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467522948] [2025-01-09 04:54:31,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:31,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:54:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:31,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:54:31,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:54:31,422 INFO L87 Difference]: Start difference. First operand 1568 states and 2195 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:33,125 INFO L93 Difference]: Finished difference Result 3176 states and 4484 transitions. [2025-01-09 04:54:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:54:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:33,130 INFO L225 Difference]: With dead ends: 3176 [2025-01-09 04:54:33,130 INFO L226 Difference]: Without dead ends: 2981 [2025-01-09 04:54:33,130 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-01-09 04:54:33,131 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 12847 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12847 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:33,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12847 Valid, 4419 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:54:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2025-01-09 04:54:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1572. [2025-01-09 04:54:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.425145819831497) internal successors, (2199), 1571 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2199 transitions. [2025-01-09 04:54:33,147 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2199 transitions. Word has length 112 [2025-01-09 04:54:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:33,147 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2199 transitions. [2025-01-09 04:54:33,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2199 transitions. [2025-01-09 04:54:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:33,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:33,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:33,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:54:33,152 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:33,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1790606885, now seen corresponding path program 1 times [2025-01-09 04:54:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:33,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104187151] [2025-01-09 04:54:33,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:33,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:33,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:33,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:33,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104187151] [2025-01-09 04:54:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104187151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324282378] [2025-01-09 04:54:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:33,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:33,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:33,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:33,368 INFO L87 Difference]: Start difference. First operand 1572 states and 2199 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:34,519 INFO L93 Difference]: Finished difference Result 2531 states and 3533 transitions. [2025-01-09 04:54:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:34,521 INFO L225 Difference]: With dead ends: 2531 [2025-01-09 04:54:34,521 INFO L226 Difference]: Without dead ends: 2353 [2025-01-09 04:54:34,522 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-01-09 04:54:34,522 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 5748 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 3132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5748 SdHoareTripleChecker+Valid, 3753 SdHoareTripleChecker+Invalid, 3139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:34,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5748 Valid, 3753 Invalid, 3139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:54:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-01-09 04:54:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1572. [2025-01-09 04:54:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.42449773169151) internal successors, (2198), 1571 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2198 transitions. [2025-01-09 04:54:34,538 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2198 transitions. Word has length 112 [2025-01-09 04:54:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:34,538 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2198 transitions. [2025-01-09 04:54:34,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2198 transitions. [2025-01-09 04:54:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:34,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:34,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:34,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:54:34,540 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:34,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:34,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1445801686, now seen corresponding path program 1 times [2025-01-09 04:54:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:34,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150027245] [2025-01-09 04:54:34,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:34,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:34,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:34,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:34,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:34,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:34,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:34,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150027245] [2025-01-09 04:54:34,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150027245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:34,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:34,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:54:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693984033] [2025-01-09 04:54:34,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:54:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:34,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:54:34,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:54:34,869 INFO L87 Difference]: Start difference. First operand 1572 states and 2198 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:36,765 INFO L93 Difference]: Finished difference Result 3309 states and 4684 transitions. [2025-01-09 04:54:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:54:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:36,767 INFO L225 Difference]: With dead ends: 3309 [2025-01-09 04:54:36,768 INFO L226 Difference]: Without dead ends: 3089 [2025-01-09 04:54:36,768 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-01-09 04:54:36,768 INFO L435 NwaCegarLoop]: 1133 mSDtfsCounter, 11027 mSDsluCounter, 4180 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11027 SdHoareTripleChecker+Valid, 5313 SdHoareTripleChecker+Invalid, 4687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:36,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11027 Valid, 5313 Invalid, 4687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:54:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2025-01-09 04:54:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 1576. [2025-01-09 04:54:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.4234001292824823) internal successors, (2202), 1575 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2202 transitions. [2025-01-09 04:54:36,782 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2202 transitions. Word has length 112 [2025-01-09 04:54:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:36,783 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2202 transitions. [2025-01-09 04:54:36,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2202 transitions. [2025-01-09 04:54:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:36,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:36,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:36,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:54:36,784 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:36,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash 977250997, now seen corresponding path program 1 times [2025-01-09 04:54:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743121057] [2025-01-09 04:54:36,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:36,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:36,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:36,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:36,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743121057] [2025-01-09 04:54:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743121057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:36,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:36,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:36,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758459299] [2025-01-09 04:54:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:36,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:36,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:36,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:36,988 INFO L87 Difference]: Start difference. First operand 1576 states and 2202 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:38,338 INFO L93 Difference]: Finished difference Result 2591 states and 3629 transitions. [2025-01-09 04:54:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:38,340 INFO L225 Difference]: With dead ends: 2591 [2025-01-09 04:54:38,340 INFO L226 Difference]: Without dead ends: 2401 [2025-01-09 04:54:38,341 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-01-09 04:54:38,341 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 6458 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6458 SdHoareTripleChecker+Valid, 5058 SdHoareTripleChecker+Invalid, 4059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:38,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6458 Valid, 5058 Invalid, 4059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-01-09 04:54:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1576. [2025-01-09 04:54:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.422753716871364) internal successors, (2201), 1575 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2201 transitions. [2025-01-09 04:54:38,352 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2201 transitions. Word has length 112 [2025-01-09 04:54:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:38,352 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2201 transitions. [2025-01-09 04:54:38,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2201 transitions. [2025-01-09 04:54:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:38,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:38,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:38,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:54:38,354 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:38,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1047979927, now seen corresponding path program 1 times [2025-01-09 04:54:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:38,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852609635] [2025-01-09 04:54:38,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:38,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:38,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:38,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:38,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852609635] [2025-01-09 04:54:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852609635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:38,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868828165] [2025-01-09 04:54:38,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:38,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:38,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:38,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:38,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:38,545 INFO L87 Difference]: Start difference. First operand 1576 states and 2201 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:39,656 INFO L93 Difference]: Finished difference Result 2591 states and 3628 transitions. [2025-01-09 04:54:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:39,659 INFO L225 Difference]: With dead ends: 2591 [2025-01-09 04:54:39,659 INFO L226 Difference]: Without dead ends: 2401 [2025-01-09 04:54:39,660 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-01-09 04:54:39,660 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 5656 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5656 SdHoareTripleChecker+Valid, 3964 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:39,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5656 Valid, 3964 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3220 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:54:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-01-09 04:54:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1576. [2025-01-09 04:54:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.4221073044602457) internal successors, (2200), 1575 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2200 transitions. [2025-01-09 04:54:39,673 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2200 transitions. Word has length 112 [2025-01-09 04:54:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2200 transitions. [2025-01-09 04:54:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2200 transitions. [2025-01-09 04:54:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:39,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:39,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:39,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:54:39,674 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash -619395701, now seen corresponding path program 1 times [2025-01-09 04:54:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104816710] [2025-01-09 04:54:39,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:39,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:39,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:39,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:39,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104816710] [2025-01-09 04:54:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104816710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970773210] [2025-01-09 04:54:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:39,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:39,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:39,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:39,883 INFO L87 Difference]: Start difference. First operand 1576 states and 2200 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:41,164 INFO L93 Difference]: Finished difference Result 2589 states and 3624 transitions. [2025-01-09 04:54:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:41,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:41,167 INFO L225 Difference]: With dead ends: 2589 [2025-01-09 04:54:41,167 INFO L226 Difference]: Without dead ends: 2401 [2025-01-09 04:54:41,167 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-01-09 04:54:41,168 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 6549 mSDsluCounter, 3923 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6549 SdHoareTripleChecker+Valid, 4840 SdHoareTripleChecker+Invalid, 3870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:41,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6549 Valid, 4840 Invalid, 3870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-01-09 04:54:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1576. [2025-01-09 04:54:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.4214608920491274) internal successors, (2199), 1575 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2199 transitions. [2025-01-09 04:54:41,179 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2199 transitions. Word has length 112 [2025-01-09 04:54:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:41,179 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2199 transitions. [2025-01-09 04:54:41,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2199 transitions. [2025-01-09 04:54:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:41,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:41,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:41,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:54:41,181 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:41,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2062151563, now seen corresponding path program 1 times [2025-01-09 04:54:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279758192] [2025-01-09 04:54:41,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:41,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:41,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:41,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:41,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:41,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:41,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:41,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279758192] [2025-01-09 04:54:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279758192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:41,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:41,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:54:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209297330] [2025-01-09 04:54:41,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:41,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:54:41,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:41,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:54:41,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:54:41,495 INFO L87 Difference]: Start difference. First operand 1576 states and 2199 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:43,213 INFO L93 Difference]: Finished difference Result 3357 states and 4743 transitions. [2025-01-09 04:54:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:54:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:43,216 INFO L225 Difference]: With dead ends: 3357 [2025-01-09 04:54:43,216 INFO L226 Difference]: Without dead ends: 3089 [2025-01-09 04:54:43,217 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-01-09 04:54:43,217 INFO L435 NwaCegarLoop]: 1025 mSDtfsCounter, 12285 mSDsluCounter, 3814 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12285 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:43,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12285 Valid, 4839 Invalid, 4232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:54:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2025-01-09 04:54:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 1584. [2025-01-09 04:54:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1555 states have (on average 1.4192926045016077) internal successors, (2207), 1583 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2207 transitions. [2025-01-09 04:54:43,232 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2207 transitions. Word has length 112 [2025-01-09 04:54:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:43,232 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2207 transitions. [2025-01-09 04:54:43,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2207 transitions. [2025-01-09 04:54:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:43,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:43,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:43,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:54:43,234 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -353306795, now seen corresponding path program 1 times [2025-01-09 04:54:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181633971] [2025-01-09 04:54:43,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:43,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:43,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:43,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:43,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181633971] [2025-01-09 04:54:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181633971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:43,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:43,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892444683] [2025-01-09 04:54:43,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:43,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:43,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:43,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:43,486 INFO L87 Difference]: Start difference. First operand 1584 states and 2207 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:44,789 INFO L93 Difference]: Finished difference Result 2623 states and 3665 transitions. [2025-01-09 04:54:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:44,792 INFO L225 Difference]: With dead ends: 2623 [2025-01-09 04:54:44,792 INFO L226 Difference]: Without dead ends: 2409 [2025-01-09 04:54:44,793 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-01-09 04:54:44,793 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 6543 mSDsluCounter, 3923 mSDsCounter, 0 mSdLazyCounter, 3859 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6543 SdHoareTripleChecker+Valid, 4840 SdHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:44,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6543 Valid, 4840 Invalid, 3866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3859 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-01-09 04:54:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 1584. [2025-01-09 04:54:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1555 states have (on average 1.4180064308681672) internal successors, (2205), 1583 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2205 transitions. [2025-01-09 04:54:44,808 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2205 transitions. Word has length 112 [2025-01-09 04:54:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:44,809 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2205 transitions. [2025-01-09 04:54:44,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2205 transitions. [2025-01-09 04:54:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:44,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:44,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:44,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:54:44,810 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:44,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1134395, now seen corresponding path program 1 times [2025-01-09 04:54:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208160732] [2025-01-09 04:54:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:44,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:44,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:44,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:44,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208160732] [2025-01-09 04:54:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208160732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765646389] [2025-01-09 04:54:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:44,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:44,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:44,995 INFO L87 Difference]: Start difference. First operand 1584 states and 2205 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:46,169 INFO L93 Difference]: Finished difference Result 2689 states and 3765 transitions. [2025-01-09 04:54:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:46,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:46,171 INFO L225 Difference]: With dead ends: 2689 [2025-01-09 04:54:46,171 INFO L226 Difference]: Without dead ends: 2425 [2025-01-09 04:54:46,172 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-01-09 04:54:46,172 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 6336 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 3426 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6336 SdHoareTripleChecker+Valid, 4360 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:46,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6336 Valid, 4360 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3426 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2025-01-09 04:54:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1584. [2025-01-09 04:54:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1555 states have (on average 1.4167202572347266) internal successors, (2203), 1583 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2203 transitions. [2025-01-09 04:54:46,182 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2203 transitions. Word has length 112 [2025-01-09 04:54:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:46,183 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2203 transitions. [2025-01-09 04:54:46,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2203 transitions. [2025-01-09 04:54:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:46,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:46,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:46,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:54:46,184 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -469685084, now seen corresponding path program 1 times [2025-01-09 04:54:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707430518] [2025-01-09 04:54:46,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:46,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:46,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707430518] [2025-01-09 04:54:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707430518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:46,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:46,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599386305] [2025-01-09 04:54:46,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:46,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:46,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:46,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:46,356 INFO L87 Difference]: Start difference. First operand 1584 states and 2203 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:47,477 INFO L93 Difference]: Finished difference Result 2619 states and 3658 transitions. [2025-01-09 04:54:47,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:47,480 INFO L225 Difference]: With dead ends: 2619 [2025-01-09 04:54:47,480 INFO L226 Difference]: Without dead ends: 2409 [2025-01-09 04:54:47,480 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-01-09 04:54:47,480 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 5504 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 3324 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5504 SdHoareTripleChecker+Valid, 4123 SdHoareTripleChecker+Invalid, 3331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:47,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5504 Valid, 4123 Invalid, 3331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3324 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:54:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-01-09 04:54:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 1584. [2025-01-09 04:54:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1555 states have (on average 1.4154340836012862) internal successors, (2201), 1583 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2201 transitions. [2025-01-09 04:54:47,498 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2201 transitions. Word has length 112 [2025-01-09 04:54:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:47,498 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2201 transitions. [2025-01-09 04:54:47,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2201 transitions. [2025-01-09 04:54:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:47,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:47,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:47,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:54:47,500 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:47,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash -79489975, now seen corresponding path program 1 times [2025-01-09 04:54:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888771486] [2025-01-09 04:54:47,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:47,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:47,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:47,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:47,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888771486] [2025-01-09 04:54:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888771486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:47,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:54:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505881956] [2025-01-09 04:54:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:47,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:54:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:47,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:54:47,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:54:47,776 INFO L87 Difference]: Start difference. First operand 1584 states and 2201 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:49,830 INFO L93 Difference]: Finished difference Result 3641 states and 5139 transitions. [2025-01-09 04:54:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:54:49,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:49,833 INFO L225 Difference]: With dead ends: 3641 [2025-01-09 04:54:49,833 INFO L226 Difference]: Without dead ends: 3217 [2025-01-09 04:54:49,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:54:49,834 INFO L435 NwaCegarLoop]: 1204 mSDtfsCounter, 8775 mSDsluCounter, 5615 mSDsCounter, 0 mSdLazyCounter, 5501 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8775 SdHoareTripleChecker+Valid, 6819 SdHoareTripleChecker+Invalid, 5813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 5501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:49,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8775 Valid, 6819 Invalid, 5813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 5501 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:54:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-01-09 04:54:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 1592. [2025-01-09 04:54:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1563 states have (on average 1.4133077415227127) internal successors, (2209), 1591 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2209 transitions. [2025-01-09 04:54:49,848 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2209 transitions. Word has length 112 [2025-01-09 04:54:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:49,848 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2209 transitions. [2025-01-09 04:54:49,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2209 transitions. [2025-01-09 04:54:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:49,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:49,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:49,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:54:49,850 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:49,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1562562040, now seen corresponding path program 1 times [2025-01-09 04:54:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944639492] [2025-01-09 04:54:49,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:49,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:49,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:49,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:49,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944639492] [2025-01-09 04:54:50,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944639492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:50,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:50,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008017065] [2025-01-09 04:54:50,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:50,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:50,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:50,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:50,024 INFO L87 Difference]: Start difference. First operand 1592 states and 2209 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:51,289 INFO L93 Difference]: Finished difference Result 2635 states and 3673 transitions. [2025-01-09 04:54:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:51,291 INFO L225 Difference]: With dead ends: 2635 [2025-01-09 04:54:51,292 INFO L226 Difference]: Without dead ends: 2417 [2025-01-09 04:54:51,292 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-01-09 04:54:51,292 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 5015 mSDsluCounter, 4036 mSDsCounter, 0 mSdLazyCounter, 3973 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5015 SdHoareTripleChecker+Valid, 4990 SdHoareTripleChecker+Invalid, 3979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:51,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5015 Valid, 4990 Invalid, 3979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3973 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2025-01-09 04:54:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1592. [2025-01-09 04:54:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1563 states have (on average 1.4120281509916826) internal successors, (2207), 1591 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2207 transitions. [2025-01-09 04:54:51,303 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2207 transitions. Word has length 112 [2025-01-09 04:54:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:51,303 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2207 transitions. [2025-01-09 04:54:51,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2207 transitions. [2025-01-09 04:54:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:54:51,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:51,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:51,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:54:51,304 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:51,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -725792126, now seen corresponding path program 1 times [2025-01-09 04:54:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:51,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872669754] [2025-01-09 04:54:51,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:51,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:54:51,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:54:51,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:51,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872669754] [2025-01-09 04:54:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872669754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462091340] [2025-01-09 04:54:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:51,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:51,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:51,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:51,487 INFO L87 Difference]: Start difference. First operand 1592 states and 2207 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:52,668 INFO L93 Difference]: Finished difference Result 2717 states and 3792 transitions. [2025-01-09 04:54:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:52,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:54:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:52,671 INFO L225 Difference]: With dead ends: 2717 [2025-01-09 04:54:52,671 INFO L226 Difference]: Without dead ends: 2433 [2025-01-09 04:54:52,671 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-01-09 04:54:52,672 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 7292 mSDsluCounter, 3350 mSDsCounter, 0 mSdLazyCounter, 3420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7292 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:52,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7292 Valid, 4354 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3420 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2025-01-09 04:54:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 1592. [2025-01-09 04:54:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1563 states have (on average 1.4107485604606527) internal successors, (2205), 1591 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2205 transitions. [2025-01-09 04:54:52,684 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2205 transitions. Word has length 112 [2025-01-09 04:54:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:52,684 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2205 transitions. [2025-01-09 04:54:52,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2205 transitions. [2025-01-09 04:54:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 04:54:52,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:52,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:52,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:54:52,686 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:52,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1670323868, now seen corresponding path program 1 times [2025-01-09 04:54:52,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:52,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213514870] [2025-01-09 04:54:52,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:52,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 04:54:52,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 04:54:52,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:52,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:52,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-01-09 04:54:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:52,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213514870] [2025-01-09 04:54:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213514870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:52,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823290498] [2025-01-09 04:54:52,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:52,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:52,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:52,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:52,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:52,862 INFO L87 Difference]: Start difference. First operand 1592 states and 2205 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:54,109 INFO L93 Difference]: Finished difference Result 2612 states and 3636 transitions. [2025-01-09 04:54:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-01-09 04:54:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:54,111 INFO L225 Difference]: With dead ends: 2612 [2025-01-09 04:54:54,111 INFO L226 Difference]: Without dead ends: 2417 [2025-01-09 04:54:54,111 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-01-09 04:54:54,111 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 7095 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7095 SdHoareTripleChecker+Valid, 4380 SdHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:54,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7095 Valid, 4380 Invalid, 3531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3524 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2025-01-09 04:54:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1588. [2025-01-09 04:54:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1559 states have (on average 1.4111610006414368) internal successors, (2200), 1587 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2200 transitions. [2025-01-09 04:54:54,121 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2200 transitions. Word has length 113 [2025-01-09 04:54:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:54,122 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2200 transitions. [2025-01-09 04:54:54,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2200 transitions. [2025-01-09 04:54:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 04:54:54,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:54,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:54,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:54:54,123 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:54,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash -428458543, now seen corresponding path program 1 times [2025-01-09 04:54:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569435246] [2025-01-09 04:54:54,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:54,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 04:54:54,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 04:54:54,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:54,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569435246] [2025-01-09 04:54:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569435246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366059072] [2025-01-09 04:54:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:54,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:54,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:54,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:54,301 INFO L87 Difference]: Start difference. First operand 1588 states and 2200 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:55,482 INFO L93 Difference]: Finished difference Result 2649 states and 3696 transitions. [2025-01-09 04:54:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-01-09 04:54:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:55,484 INFO L225 Difference]: With dead ends: 2649 [2025-01-09 04:54:55,484 INFO L226 Difference]: Without dead ends: 2429 [2025-01-09 04:54:55,484 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-01-09 04:54:55,485 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 3383 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3383 SdHoareTripleChecker+Valid, 4499 SdHoareTripleChecker+Invalid, 3562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:55,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3383 Valid, 4499 Invalid, 3562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:54:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2025-01-09 04:54:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1584. [2025-01-09 04:54:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1555 states have (on average 1.4115755627009647) internal successors, (2195), 1583 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2195 transitions. [2025-01-09 04:54:55,495 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2195 transitions. Word has length 113 [2025-01-09 04:54:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:55,495 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2195 transitions. [2025-01-09 04:54:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2195 transitions. [2025-01-09 04:54:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 04:54:55,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:55,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:54:55,497 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1166295979, now seen corresponding path program 1 times [2025-01-09 04:54:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008102099] [2025-01-09 04:54:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:55,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 04:54:55,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 04:54:55,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:55,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008102099] [2025-01-09 04:54:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008102099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:55,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088962868] [2025-01-09 04:54:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:55,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:55,647 INFO L87 Difference]: Start difference. First operand 1584 states and 2195 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:56,960 INFO L93 Difference]: Finished difference Result 2885 states and 4022 transitions. [2025-01-09 04:54:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:56,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-01-09 04:54:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:56,962 INFO L225 Difference]: With dead ends: 2885 [2025-01-09 04:54:56,962 INFO L226 Difference]: Without dead ends: 2461 [2025-01-09 04:54:56,963 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-01-09 04:54:56,963 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 4493 mSDsluCounter, 4127 mSDsCounter, 0 mSdLazyCounter, 4181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4493 SdHoareTripleChecker+Valid, 5385 SdHoareTripleChecker+Invalid, 4187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:56,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4493 Valid, 5385 Invalid, 4187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4181 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2025-01-09 04:54:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 1576. [2025-01-09 04:54:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.4124111182934713) internal successors, (2185), 1575 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2185 transitions. [2025-01-09 04:54:56,975 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2185 transitions. Word has length 113 [2025-01-09 04:54:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:56,976 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2185 transitions. [2025-01-09 04:54:56,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2185 transitions. [2025-01-09 04:54:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 04:54:56,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:56,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:56,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:54:56,977 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 927714838, now seen corresponding path program 1 times [2025-01-09 04:54:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730170410] [2025-01-09 04:54:56,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:56,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 04:54:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 04:54:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730170410] [2025-01-09 04:54:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730170410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129444038] [2025-01-09 04:54:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:57,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:57,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:57,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:57,145 INFO L87 Difference]: Start difference. First operand 1576 states and 2185 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:58,448 INFO L93 Difference]: Finished difference Result 2689 states and 3749 transitions. [2025-01-09 04:54:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:54:58,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-01-09 04:54:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:58,451 INFO L225 Difference]: With dead ends: 2689 [2025-01-09 04:54:58,451 INFO L226 Difference]: Without dead ends: 2421 [2025-01-09 04:54:58,451 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-01-09 04:54:58,452 INFO L435 NwaCegarLoop]: 1247 mSDtfsCounter, 4491 mSDsluCounter, 4074 mSDsCounter, 0 mSdLazyCounter, 4185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4491 SdHoareTripleChecker+Valid, 5321 SdHoareTripleChecker+Invalid, 4190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:58,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4491 Valid, 5321 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4185 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-01-09 04:54:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-01-09 04:54:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4132553606237817) internal successors, (2175), 1567 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2175 transitions. [2025-01-09 04:54:58,462 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2175 transitions. Word has length 113 [2025-01-09 04:54:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:54:58,462 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2175 transitions. [2025-01-09 04:54:58,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2175 transitions. [2025-01-09 04:54:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:54:58,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:54:58,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:54:58,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:54:58,464 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:54:58,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:54:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1355474368, now seen corresponding path program 1 times [2025-01-09 04:54:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:54:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923623447] [2025-01-09 04:54:58,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:54:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:54:58,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:54:58,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:54:58,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:54:58,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:54:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:54:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:54:58,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923623447] [2025-01-09 04:54:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923623447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:54:58,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:54:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:54:58,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493932718] [2025-01-09 04:54:58,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:54:58,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:54:58,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:54:58,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:54:58,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:54:58,651 INFO L87 Difference]: Start difference. First operand 1568 states and 2175 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:54:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:54:59,986 INFO L93 Difference]: Finished difference Result 2531 states and 3512 transitions. [2025-01-09 04:54:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:54:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:54:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:54:59,988 INFO L225 Difference]: With dead ends: 2531 [2025-01-09 04:54:59,988 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 04:54:59,989 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-01-09 04:54:59,989 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 6266 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 4276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6266 SdHoareTripleChecker+Valid, 5231 SdHoareTripleChecker+Invalid, 4282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:54:59,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6266 Valid, 5231 Invalid, 4282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:54:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 04:54:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-01-09 04:54:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4126055880441846) internal successors, (2174), 1567 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2174 transitions. [2025-01-09 04:55:00,000 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2174 transitions. Word has length 114 [2025-01-09 04:55:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:00,001 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2174 transitions. [2025-01-09 04:55:00,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2174 transitions. [2025-01-09 04:55:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:00,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:00,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:00,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:55:00,003 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:00,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:00,003 INFO L85 PathProgramCache]: Analyzing trace with hash -987372193, now seen corresponding path program 1 times [2025-01-09 04:55:00,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:00,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432407366] [2025-01-09 04:55:00,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:00,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:00,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:00,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:00,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432407366] [2025-01-09 04:55:00,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432407366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:00,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:00,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377574046] [2025-01-09 04:55:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:00,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:00,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:00,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:00,161 INFO L87 Difference]: Start difference. First operand 1568 states and 2174 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:01,167 INFO L93 Difference]: Finished difference Result 2436 states and 3344 transitions. [2025-01-09 04:55:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:55:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:01,169 INFO L225 Difference]: With dead ends: 2436 [2025-01-09 04:55:01,169 INFO L226 Difference]: Without dead ends: 2261 [2025-01-09 04:55:01,170 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-01-09 04:55:01,170 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 3999 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3999 SdHoareTripleChecker+Valid, 3233 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:01,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3999 Valid, 3233 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:55:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-01-09 04:55:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1568. [2025-01-09 04:55:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4119558154645875) internal successors, (2173), 1567 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2173 transitions. [2025-01-09 04:55:01,181 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2173 transitions. Word has length 114 [2025-01-09 04:55:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:01,181 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2173 transitions. [2025-01-09 04:55:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2173 transitions. [2025-01-09 04:55:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:01,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:01,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:01,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:55:01,183 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:01,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash -351977045, now seen corresponding path program 1 times [2025-01-09 04:55:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695350207] [2025-01-09 04:55:01,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:01,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:01,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:01,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:01,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695350207] [2025-01-09 04:55:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695350207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:01,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:01,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782794132] [2025-01-09 04:55:01,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:01,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:01,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:01,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:01,351 INFO L87 Difference]: Start difference. First operand 1568 states and 2173 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:02,481 INFO L93 Difference]: Finished difference Result 2527 states and 3505 transitions. [2025-01-09 04:55:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:55:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:02,483 INFO L225 Difference]: With dead ends: 2527 [2025-01-09 04:55:02,483 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 04:55:02,484 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-01-09 04:55:02,484 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 4200 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 3469 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4200 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:02,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4200 Valid, 4216 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:55:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 04:55:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-01-09 04:55:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4113060428849902) internal successors, (2172), 1567 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2172 transitions. [2025-01-09 04:55:02,495 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2172 transitions. Word has length 114 [2025-01-09 04:55:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:02,495 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2172 transitions. [2025-01-09 04:55:02,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2172 transitions. [2025-01-09 04:55:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:02,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:02,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:02,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:55:02,496 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:02,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1812075390, now seen corresponding path program 1 times [2025-01-09 04:55:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:02,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015621115] [2025-01-09 04:55:02,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:02,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:02,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:02,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:02,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:02,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015621115] [2025-01-09 04:55:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015621115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285476860] [2025-01-09 04:55:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:02,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:02,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:02,699 INFO L87 Difference]: Start difference. First operand 1568 states and 2172 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:04,022 INFO L93 Difference]: Finished difference Result 2527 states and 3504 transitions. [2025-01-09 04:55:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:55:04,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:04,024 INFO L225 Difference]: With dead ends: 2527 [2025-01-09 04:55:04,024 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 04:55:04,024 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-01-09 04:55:04,025 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 6255 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6255 SdHoareTripleChecker+Valid, 5231 SdHoareTripleChecker+Invalid, 4263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:04,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6255 Valid, 5231 Invalid, 4263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4257 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:55:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 04:55:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-01-09 04:55:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.410656270305393) internal successors, (2171), 1567 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2171 transitions. [2025-01-09 04:55:04,035 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2171 transitions. Word has length 114 [2025-01-09 04:55:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:04,035 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2171 transitions. [2025-01-09 04:55:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2171 transitions. [2025-01-09 04:55:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:04,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:04,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:04,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 04:55:04,037 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:04,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1847714225, now seen corresponding path program 1 times [2025-01-09 04:55:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627297965] [2025-01-09 04:55:04,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:04,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:04,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:04,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627297965] [2025-01-09 04:55:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627297965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:04,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:04,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579323761] [2025-01-09 04:55:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:04,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:04,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:04,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:04,220 INFO L87 Difference]: Start difference. First operand 1568 states and 2171 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:05,424 INFO L93 Difference]: Finished difference Result 2531 states and 3507 transitions. [2025-01-09 04:55:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:55:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:05,427 INFO L225 Difference]: With dead ends: 2531 [2025-01-09 04:55:05,427 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 04:55:05,428 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-01-09 04:55:05,428 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 6961 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 3468 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6961 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:05,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6961 Valid, 4201 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3468 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:55:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 04:55:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-01-09 04:55:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.410006497725796) internal successors, (2170), 1567 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2170 transitions. [2025-01-09 04:55:05,440 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2170 transitions. Word has length 114 [2025-01-09 04:55:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:05,440 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2170 transitions. [2025-01-09 04:55:05,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2170 transitions. [2025-01-09 04:55:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:05,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:05,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:05,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 04:55:05,442 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:05,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:05,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1990981026, now seen corresponding path program 1 times [2025-01-09 04:55:05,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:05,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509671722] [2025-01-09 04:55:05,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:05,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:05,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:05,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:05,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:05,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:05,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509671722] [2025-01-09 04:55:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509671722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:05,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:05,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:05,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707755902] [2025-01-09 04:55:05,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:05,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:05,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:05,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:05,623 INFO L87 Difference]: Start difference. First operand 1568 states and 2170 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:07,003 INFO L93 Difference]: Finished difference Result 2587 states and 3596 transitions. [2025-01-09 04:55:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:55:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:07,005 INFO L225 Difference]: With dead ends: 2587 [2025-01-09 04:55:07,005 INFO L226 Difference]: Without dead ends: 2397 [2025-01-09 04:55:07,006 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-01-09 04:55:07,006 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 4610 mSDsluCounter, 4646 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4610 SdHoareTripleChecker+Valid, 5804 SdHoareTripleChecker+Invalid, 4565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:07,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4610 Valid, 5804 Invalid, 4565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4560 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:55:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-01-09 04:55:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-01-09 04:55:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.409356725146199) internal successors, (2169), 1567 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2169 transitions. [2025-01-09 04:55:07,018 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2169 transitions. Word has length 114 [2025-01-09 04:55:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2169 transitions. [2025-01-09 04:55:07,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2169 transitions. [2025-01-09 04:55:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:07,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:07,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:07,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 04:55:07,020 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:07,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1368364718, now seen corresponding path program 1 times [2025-01-09 04:55:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75964941] [2025-01-09 04:55:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:07,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:07,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:07,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:07,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75964941] [2025-01-09 04:55:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75964941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640075335] [2025-01-09 04:55:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:07,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:07,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:07,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:07,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:07,212 INFO L87 Difference]: Start difference. First operand 1568 states and 2169 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:08,547 INFO L93 Difference]: Finished difference Result 2527 states and 3500 transitions. [2025-01-09 04:55:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:55:08,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:08,549 INFO L225 Difference]: With dead ends: 2527 [2025-01-09 04:55:08,549 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 04:55:08,550 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-01-09 04:55:08,550 INFO L435 NwaCegarLoop]: 1063 mSDtfsCounter, 6209 mSDsluCounter, 4248 mSDsCounter, 0 mSdLazyCounter, 4286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6209 SdHoareTripleChecker+Valid, 5311 SdHoareTripleChecker+Invalid, 4292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:08,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6209 Valid, 5311 Invalid, 4292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4286 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:55:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 04:55:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-01-09 04:55:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4087069525666016) internal successors, (2168), 1567 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2168 transitions. [2025-01-09 04:55:08,560 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2168 transitions. Word has length 114 [2025-01-09 04:55:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:08,560 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2168 transitions. [2025-01-09 04:55:08,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2168 transitions. [2025-01-09 04:55:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:08,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:08,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:08,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 04:55:08,562 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:08,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2003131297, now seen corresponding path program 1 times [2025-01-09 04:55:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225228830] [2025-01-09 04:55:08,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:08,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:08,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:08,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:08,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:08,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225228830] [2025-01-09 04:55:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225228830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:08,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:08,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:08,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118900617] [2025-01-09 04:55:08,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:08,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:08,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:08,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:08,729 INFO L87 Difference]: Start difference. First operand 1568 states and 2168 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:10,029 INFO L93 Difference]: Finished difference Result 2531 states and 3502 transitions. [2025-01-09 04:55:10,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:55:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:10,032 INFO L225 Difference]: With dead ends: 2531 [2025-01-09 04:55:10,032 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 04:55:10,032 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-01-09 04:55:10,032 INFO L435 NwaCegarLoop]: 1061 mSDtfsCounter, 4784 mSDsluCounter, 4235 mSDsCounter, 0 mSdLazyCounter, 4287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4784 SdHoareTripleChecker+Valid, 5296 SdHoareTripleChecker+Invalid, 4292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:10,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4784 Valid, 5296 Invalid, 4292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:55:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 04:55:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-01-09 04:55:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4080571799870045) internal successors, (2167), 1567 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2167 transitions. [2025-01-09 04:55:10,043 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2167 transitions. Word has length 114 [2025-01-09 04:55:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:10,044 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2167 transitions. [2025-01-09 04:55:10,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2167 transitions. [2025-01-09 04:55:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:10,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:10,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:10,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 04:55:10,046 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1167481258, now seen corresponding path program 1 times [2025-01-09 04:55:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368494339] [2025-01-09 04:55:10,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:10,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:10,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:10,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:10,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:10,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368494339] [2025-01-09 04:55:10,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368494339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:10,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:10,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:55:10,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462248669] [2025-01-09 04:55:10,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:10,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:55:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:10,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:55:10,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:55:10,319 INFO L87 Difference]: Start difference. First operand 1568 states and 2167 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:12,112 INFO L93 Difference]: Finished difference Result 3031 states and 4229 transitions. [2025-01-09 04:55:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:55:12,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-09 04:55:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:12,114 INFO L225 Difference]: With dead ends: 3031 [2025-01-09 04:55:12,114 INFO L226 Difference]: Without dead ends: 2853 [2025-01-09 04:55:12,114 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-01-09 04:55:12,115 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 11692 mSDsluCounter, 4546 mSDsCounter, 0 mSdLazyCounter, 4581 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11692 SdHoareTripleChecker+Valid, 5554 SdHoareTripleChecker+Invalid, 4920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 4581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:12,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11692 Valid, 5554 Invalid, 4920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 4581 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:55:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2025-01-09 04:55:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1572. [2025-01-09 04:55:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.40699935191186) internal successors, (2171), 1571 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2171 transitions. [2025-01-09 04:55:12,126 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2171 transitions. Word has length 114 [2025-01-09 04:55:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:12,126 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2171 transitions. [2025-01-09 04:55:12,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2171 transitions. [2025-01-09 04:55:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:55:12,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:12,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:12,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 04:55:12,127 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 04:55:12,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash -340131803, now seen corresponding path program 1 times [2025-01-09 04:55:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036150785] [2025-01-09 04:55:12,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:12,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:55:12,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:55:12,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:12,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:55:12,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:12,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036150785] [2025-01-09 04:55:12,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036150785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:12,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:12,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:55:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901497721] [2025-01-09 04:55:12,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:12,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:55:12,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:12,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:55:12,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:55:12,312 INFO L87 Difference]: Start difference. First operand 1572 states and 2171 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)