./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7dc718442bb91da0bdb0fa6a159b603baccf5b9195c06341082ea90462d0b755 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:42:41,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:42:41,304 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:42:41,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:42:41,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:42:41,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:42:41,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:42:41,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:42:41,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:42:41,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:42:41,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:42:41,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:42:41,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:42:41,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:42:41,344 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:42:41,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:42:41,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:42:41,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:42:41,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:42:41,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:42:41,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:42:41,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:42:41,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:42:41,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:42:41,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:42:41,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:41,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:42:41,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:42:41,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:42:41,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:42:41,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:41,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:42:41,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:42:41,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:42:41,348 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 -> 7dc718442bb91da0bdb0fa6a159b603baccf5b9195c06341082ea90462d0b755 [2025-01-09 04:42:41,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:42:41,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:42:41,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:42:41,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:42:41,630 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:42:41,632 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-01-09 04:42:42,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fc4951a6/6e3540ad5ac14d048a28c6f09e47d6bb/FLAGff10e6b07 [2025-01-09 04:42:43,648 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:42:43,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-01-09 04:42:43,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fc4951a6/6e3540ad5ac14d048a28c6f09e47d6bb/FLAGff10e6b07 [2025-01-09 04:42:43,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9fc4951a6/6e3540ad5ac14d048a28c6f09e47d6bb [2025-01-09 04:42:43,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:42:43,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:42:43,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:42:43,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:42:43,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:42:43,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:43" (1/1) ... [2025-01-09 04:42:43,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2119bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:43, skipping insertion in model container [2025-01-09 04:42:43,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:43" (1/1) ... [2025-01-09 04:42:43,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:42:44,486 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26861,26874] [2025-01-09 04:42:44,518 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33212,33225] [2025-01-09 04:42:44,593 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[57844,57857] [2025-01-09 04:42:44,643 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[65899,65912] [2025-01-09 04:42:44,658 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71726,71739] [2025-01-09 04:42:44,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82469,82482] [2025-01-09 04:42:44,703 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90414,90427] [2025-01-09 04:42:44,716 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[97642,97655] [2025-01-09 04:42:44,771 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132349,132362] [2025-01-09 04:42:44,776 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[135477,135490] [2025-01-09 04:42:44,789 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[143490,143503] [2025-01-09 04:42:44,798 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[149294,149307] [2025-01-09 04:42:44,831 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[172040,172053] [2025-01-09 04:42:44,883 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[199876,199889] [2025-01-09 04:42:44,921 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226429,226442] [2025-01-09 04:42:44,958 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[253730,253743] [2025-01-09 04:42:44,997 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[284837,284850] [2025-01-09 04:42:45,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:42:45,240 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:42:45,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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26861,26874] [2025-01-09 04:42:45,327 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33212,33225] [2025-01-09 04:42:45,359 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[57844,57857] [2025-01-09 04:42:45,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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[65899,65912] [2025-01-09 04:42:45,378 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71726,71739] [2025-01-09 04:42:45,391 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82469,82482] [2025-01-09 04:42:45,403 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90414,90427] [2025-01-09 04:42:45,413 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[97642,97655] [2025-01-09 04:42:45,484 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132349,132362] [2025-01-09 04:42:45,489 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[135477,135490] [2025-01-09 04:42:45,500 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[143490,143503] [2025-01-09 04:42:45,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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[149294,149307] [2025-01-09 04:42:45,536 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[172040,172053] [2025-01-09 04:42:45,570 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[199876,199889] [2025-01-09 04:42:45,605 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226429,226442] [2025-01-09 04:42:45,638 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[253730,253743] [2025-01-09 04:42:45,674 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-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[284837,284850] [2025-01-09 04:42:45,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:42:45,861 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:42:45,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45 WrapperNode [2025-01-09 04:42:45,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:42:45,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:42:45,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:42:45,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:42:45,871 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:42:45" (1/1) ... [2025-01-09 04:42:45,949 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:42:45" (1/1) ... [2025-01-09 04:42:46,275 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18003 [2025-01-09 04:42:46,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:42:46,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:42:46,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:42:46,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:42:46,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,474 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:42:46,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:42:46,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:42:46,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:42:46,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:42:46,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (1/1) ... [2025-01-09 04:42:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:46,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:46,895 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:42:46,901 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:42:46,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:42:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:42:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:42:46,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:42:47,388 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:42:47,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:42:54,579 INFO L? ?]: Removed 3204 outVars from TransFormulas that were not future-live. [2025-01-09 04:42:54,579 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:42:54,675 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:42:54,675 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:42:54,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:54 BoogieIcfgContainer [2025-01-09 04:42:54,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:42:54,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:42:54,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:42:54,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:42:54,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:43" (1/3) ... [2025-01-09 04:42:54,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395c0d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:54, skipping insertion in model container [2025-01-09 04:42:54,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:45" (2/3) ... [2025-01-09 04:42:54,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395c0d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:54, skipping insertion in model container [2025-01-09 04:42:54,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:54" (3/3) ... [2025-01-09 04:42:54,685 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-01-09 04:42:54,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:42:54,705 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 3532 locations, 1 initial locations, 0 loop locations, and 17 error locations. [2025-01-09 04:42:54,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:42:54,853 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;@79edb84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:42:54,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 04:42:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 3532 states, 3514 states have (on average 1.8264086511098463) internal successors, (6418), 3531 states have internal predecessors, (6418), 0 states have call successors, (0), 0 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:42:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:42:54,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:54,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] [2025-01-09 04:42:54,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:42:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash -912153875, now seen corresponding path program 1 times [2025-01-09 04:42:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883495294] [2025-01-09 04:42:54,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:42:55,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:42:55,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:55,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:55,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883495294] [2025-01-09 04:42:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883495294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403726410] [2025-01-09 04:42:55,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:55,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:55,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:55,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:55,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:55,694 INFO L87 Difference]: Start difference. First operand has 3532 states, 3514 states have (on average 1.8264086511098463) internal successors, (6418), 3531 states have internal predecessors, (6418), 0 states have call successors, (0), 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 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:42:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:59,578 INFO L93 Difference]: Finished difference Result 6649 states and 11844 transitions. [2025-01-09 04:42:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:59,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:42:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:59,612 INFO L225 Difference]: With dead ends: 6649 [2025-01-09 04:42:59,612 INFO L226 Difference]: Without dead ends: 4229 [2025-01-09 04:42:59,620 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:42:59,623 INFO L435 NwaCegarLoop]: 2778 mSDtfsCounter, 19753 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 3603 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19753 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 3603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:59,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19753 Valid, 3952 Invalid, 3740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 3603 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 04:42:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4229 states. [2025-01-09 04:42:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4229 to 4205. [2025-01-09 04:42:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4205 states, 4188 states have (on average 1.3385864374403056) internal successors, (5606), 4204 states have internal predecessors, (5606), 0 states have call successors, (0), 0 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:42:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 5606 transitions. [2025-01-09 04:42:59,825 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 5606 transitions. Word has length 64 [2025-01-09 04:42:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:59,825 INFO L471 AbstractCegarLoop]: Abstraction has 4205 states and 5606 transitions. [2025-01-09 04:42:59,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:42:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 5606 transitions. [2025-01-09 04:42:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:42:59,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:59,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:42:59,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:42:59,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash -919069742, now seen corresponding path program 1 times [2025-01-09 04:42:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929783680] [2025-01-09 04:42:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:59,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:42:59,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:42:59,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:00,162 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:43:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929783680] [2025-01-09 04:43:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929783680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687850214] [2025-01-09 04:43:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:00,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:00,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:00,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:00,165 INFO L87 Difference]: Start difference. First operand 4205 states and 5606 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:43:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:02,471 INFO L93 Difference]: Finished difference Result 7816 states and 10452 transitions. [2025-01-09 04:43:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:43:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:02,491 INFO L225 Difference]: With dead ends: 7816 [2025-01-09 04:43:02,491 INFO L226 Difference]: Without dead ends: 4781 [2025-01-09 04:43:02,496 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:43:02,497 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 11477 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11477 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:02,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11477 Valid, 2077 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:43:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2025-01-09 04:43:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4761. [2025-01-09 04:43:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4744 states have (on average 1.3505480607082632) internal successors, (6407), 4760 states have internal predecessors, (6407), 0 states have call successors, (0), 0 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:43:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6407 transitions. [2025-01-09 04:43:02,615 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6407 transitions. Word has length 65 [2025-01-09 04:43:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:02,616 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6407 transitions. [2025-01-09 04:43:02,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:43:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6407 transitions. [2025-01-09 04:43:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:43:02,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:02,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:02,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:43:02,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:02,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1793005613, now seen corresponding path program 1 times [2025-01-09 04:43:02,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967334051] [2025-01-09 04:43:02,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:02,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:43:02,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:43:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:02,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:02,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967334051] [2025-01-09 04:43:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967334051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067806723] [2025-01-09 04:43:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:02,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:02,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:02,875 INFO L87 Difference]: Start difference. First operand 4761 states and 6407 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:43:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:04,490 INFO L93 Difference]: Finished difference Result 9743 states and 13157 transitions. [2025-01-09 04:43:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:04,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:43:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:04,511 INFO L225 Difference]: With dead ends: 9743 [2025-01-09 04:43:04,511 INFO L226 Difference]: Without dead ends: 6636 [2025-01-09 04:43:04,519 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:43:04,522 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 10937 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10937 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:04,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10937 Valid, 2132 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:43:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2025-01-09 04:43:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 6609. [2025-01-09 04:43:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6609 states, 6592 states have (on average 1.3577063106796117) internal successors, (8950), 6608 states have internal predecessors, (8950), 0 states have call successors, (0), 0 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:43:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 8950 transitions. [2025-01-09 04:43:04,670 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 8950 transitions. Word has length 65 [2025-01-09 04:43:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:04,672 INFO L471 AbstractCegarLoop]: Abstraction has 6609 states and 8950 transitions. [2025-01-09 04:43:04,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:43:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 8950 transitions. [2025-01-09 04:43:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:43:04,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:04,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:04,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:43:04,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:04,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash -958325289, now seen corresponding path program 1 times [2025-01-09 04:43:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500616768] [2025-01-09 04:43:04,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:04,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:43:04,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:43:04,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:04,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:05,029 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:43:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500616768] [2025-01-09 04:43:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500616768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:05,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:05,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:05,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464230391] [2025-01-09 04:43:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:05,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:05,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:05,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:05,033 INFO L87 Difference]: Start difference. First operand 6609 states and 8950 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:43:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:06,404 INFO L93 Difference]: Finished difference Result 12909 states and 17663 transitions. [2025-01-09 04:43:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:43:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:06,425 INFO L225 Difference]: With dead ends: 12909 [2025-01-09 04:43:06,425 INFO L226 Difference]: Without dead ends: 8515 [2025-01-09 04:43:06,434 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:43:06,435 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 9341 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9341 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:06,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9341 Valid, 1841 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:43:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8515 states. [2025-01-09 04:43:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8515 to 8480. [2025-01-09 04:43:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8463 states have (on average 1.3737445350348576) internal successors, (11626), 8479 states have internal predecessors, (11626), 0 states have call successors, (0), 0 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:43:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 11626 transitions. [2025-01-09 04:43:06,621 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 11626 transitions. Word has length 66 [2025-01-09 04:43:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:06,622 INFO L471 AbstractCegarLoop]: Abstraction has 8480 states and 11626 transitions. [2025-01-09 04:43:06,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:43:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 11626 transitions. [2025-01-09 04:43:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:43:06,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:06,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:43:06,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:06,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash 215811001, now seen corresponding path program 1 times [2025-01-09 04:43:06,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:06,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860095569] [2025-01-09 04:43:06,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:06,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:06,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:43:06,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:43:06,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:07,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860095569] [2025-01-09 04:43:07,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860095569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:07,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:07,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172135038] [2025-01-09 04:43:07,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:07,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:07,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:07,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:07,046 INFO L87 Difference]: Start difference. First operand 8480 states and 11626 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:43:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:10,449 INFO L93 Difference]: Finished difference Result 14362 states and 20046 transitions. [2025-01-09 04:43:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:10,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:43:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:10,513 INFO L225 Difference]: With dead ends: 14362 [2025-01-09 04:43:10,514 INFO L226 Difference]: Without dead ends: 13003 [2025-01-09 04:43:10,523 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:43:10,525 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 11232 mSDsluCounter, 4502 mSDsCounter, 0 mSdLazyCounter, 6632 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11232 SdHoareTripleChecker+Valid, 5867 SdHoareTripleChecker+Invalid, 6769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 6632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:10,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11232 Valid, 5867 Invalid, 6769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 6632 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 04:43:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13003 states. [2025-01-09 04:43:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13003 to 8423. [2025-01-09 04:43:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 8406 states have (on average 1.3733047822983584) internal successors, (11544), 8422 states have internal predecessors, (11544), 0 states have call successors, (0), 0 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:43:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 11544 transitions. [2025-01-09 04:43:10,698 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 11544 transitions. Word has length 66 [2025-01-09 04:43:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:10,698 INFO L471 AbstractCegarLoop]: Abstraction has 8423 states and 11544 transitions. [2025-01-09 04:43:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:43:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 11544 transitions. [2025-01-09 04:43:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:43:10,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:10,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:43:10,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -531315301, now seen corresponding path program 1 times [2025-01-09 04:43:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372502972] [2025-01-09 04:43:10,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:10,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:43:10,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:43:10,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:10,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:11,203 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:43:11,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:11,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372502972] [2025-01-09 04:43:11,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372502972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:11,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:11,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:43:11,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851014015] [2025-01-09 04:43:11,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:11,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:43:11,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:11,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:43:11,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:43:11,206 INFO L87 Difference]: Start difference. First operand 8423 states and 11544 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:43:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:13,624 INFO L93 Difference]: Finished difference Result 11405 states and 15883 transitions. [2025-01-09 04:43:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:43:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:13,646 INFO L225 Difference]: With dead ends: 11405 [2025-01-09 04:43:13,647 INFO L226 Difference]: Without dead ends: 9940 [2025-01-09 04:43:13,652 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:43:13,653 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 11242 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 5233 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11242 SdHoareTripleChecker+Valid, 5907 SdHoareTripleChecker+Invalid, 5248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:13,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11242 Valid, 5907 Invalid, 5248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 5233 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:43:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9940 states. [2025-01-09 04:43:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9940 to 8272. [2025-01-09 04:43:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8272 states, 8255 states have (on average 1.3727437916414293) internal successors, (11332), 8271 states have internal predecessors, (11332), 0 states have call successors, (0), 0 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:43:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 11332 transitions. [2025-01-09 04:43:13,787 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 11332 transitions. Word has length 66 [2025-01-09 04:43:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:13,787 INFO L471 AbstractCegarLoop]: Abstraction has 8272 states and 11332 transitions. [2025-01-09 04:43:13,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:43:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 11332 transitions. [2025-01-09 04:43:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:43:13,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:13,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:13,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:43:13,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1567621872, now seen corresponding path program 1 times [2025-01-09 04:43:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046452548] [2025-01-09 04:43:13,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:13,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:43:13,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:43:13,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:13,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:14,182 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:43:14,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:14,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046452548] [2025-01-09 04:43:14,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046452548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:14,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:14,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:14,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830650893] [2025-01-09 04:43:14,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:14,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:14,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:14,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:14,184 INFO L87 Difference]: Start difference. First operand 8272 states and 11332 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:17,440 INFO L93 Difference]: Finished difference Result 13225 states and 18431 transitions. [2025-01-09 04:43:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:43:17,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:43:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:17,470 INFO L225 Difference]: With dead ends: 13225 [2025-01-09 04:43:17,470 INFO L226 Difference]: Without dead ends: 13217 [2025-01-09 04:43:17,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:43:17,478 INFO L435 NwaCegarLoop]: 1428 mSDtfsCounter, 9354 mSDsluCounter, 5246 mSDsCounter, 0 mSdLazyCounter, 6511 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9354 SdHoareTripleChecker+Valid, 6674 SdHoareTripleChecker+Invalid, 6579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 6511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:17,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9354 Valid, 6674 Invalid, 6579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 6511 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 04:43:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13217 states. [2025-01-09 04:43:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13217 to 8272. [2025-01-09 04:43:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8272 states, 8255 states have (on average 1.3726226529376135) internal successors, (11331), 8271 states have internal predecessors, (11331), 0 states have call successors, (0), 0 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:43:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 11331 transitions. [2025-01-09 04:43:17,661 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 11331 transitions. Word has length 67 [2025-01-09 04:43:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:17,662 INFO L471 AbstractCegarLoop]: Abstraction has 8272 states and 11331 transitions. [2025-01-09 04:43:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 11331 transitions. [2025-01-09 04:43:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:43:17,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:17,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:17,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:43:17,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:17,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash 435988824, now seen corresponding path program 1 times [2025-01-09 04:43:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:17,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849143672] [2025-01-09 04:43:17,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:17,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:17,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:43:17,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:43:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:18,104 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:43:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849143672] [2025-01-09 04:43:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849143672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:18,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684401427] [2025-01-09 04:43:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:18,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:18,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:18,106 INFO L87 Difference]: Start difference. First operand 8272 states and 11331 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:20,589 INFO L93 Difference]: Finished difference Result 9712 states and 13342 transitions. [2025-01-09 04:43:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:20,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:43:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:20,604 INFO L225 Difference]: With dead ends: 9712 [2025-01-09 04:43:20,605 INFO L226 Difference]: Without dead ends: 9707 [2025-01-09 04:43:20,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:43:20,610 INFO L435 NwaCegarLoop]: 1375 mSDtfsCounter, 13102 mSDsluCounter, 4417 mSDsCounter, 0 mSdLazyCounter, 5178 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13102 SdHoareTripleChecker+Valid, 5792 SdHoareTripleChecker+Invalid, 5202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:20,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13102 Valid, 5792 Invalid, 5202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5178 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:43:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9707 states. [2025-01-09 04:43:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9707 to 8272. [2025-01-09 04:43:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8272 states, 8255 states have (on average 1.3725015142337977) internal successors, (11330), 8271 states have internal predecessors, (11330), 0 states have call successors, (0), 0 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:43:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 11330 transitions. [2025-01-09 04:43:20,762 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 11330 transitions. Word has length 67 [2025-01-09 04:43:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:20,762 INFO L471 AbstractCegarLoop]: Abstraction has 8272 states and 11330 transitions. [2025-01-09 04:43:20,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 11330 transitions. [2025-01-09 04:43:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:43:20,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:20,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:20,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:43:20,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:20,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2090357239, now seen corresponding path program 1 times [2025-01-09 04:43:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:20,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172080106] [2025-01-09 04:43:20,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:20,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:43:20,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:43:20,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:20,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:21,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:21,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172080106] [2025-01-09 04:43:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172080106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:21,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:21,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:43:21,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555844303] [2025-01-09 04:43:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:21,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:43:21,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:21,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:43:21,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:43:21,590 INFO L87 Difference]: Start difference. First operand 8272 states and 11330 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:22,961 INFO L93 Difference]: Finished difference Result 10293 states and 14274 transitions. [2025-01-09 04:43:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:22,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:43:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:22,978 INFO L225 Difference]: With dead ends: 10293 [2025-01-09 04:43:22,978 INFO L226 Difference]: Without dead ends: 10289 [2025-01-09 04:43:22,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:43:22,984 INFO L435 NwaCegarLoop]: 2389 mSDtfsCounter, 14839 mSDsluCounter, 9182 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14839 SdHoareTripleChecker+Valid, 11571 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:22,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14839 Valid, 11571 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:43:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10289 states. [2025-01-09 04:43:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10289 to 8268. [2025-01-09 04:43:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8268 states, 8252 states have (on average 1.372515753756665) internal successors, (11326), 8267 states have internal predecessors, (11326), 0 states have call successors, (0), 0 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:43:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 11326 transitions. [2025-01-09 04:43:23,120 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 11326 transitions. Word has length 67 [2025-01-09 04:43:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:23,120 INFO L471 AbstractCegarLoop]: Abstraction has 8268 states and 11326 transitions. [2025-01-09 04:43:23,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 11326 transitions. [2025-01-09 04:43:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:43:23,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:23,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] [2025-01-09 04:43:23,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:43:23,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:23,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash 822338575, now seen corresponding path program 1 times [2025-01-09 04:43:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:23,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127305077] [2025-01-09 04:43:23,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:23,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:43:23,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:43:23,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127305077] [2025-01-09 04:43:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127305077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:23,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:43:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630014598] [2025-01-09 04:43:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:23,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:43:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:23,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:43:23,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:43:23,861 INFO L87 Difference]: Start difference. First operand 8268 states and 11326 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:25,966 INFO L93 Difference]: Finished difference Result 12398 states and 17200 transitions. [2025-01-09 04:43:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:43:25,967 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:43:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:25,984 INFO L225 Difference]: With dead ends: 12398 [2025-01-09 04:43:25,984 INFO L226 Difference]: Without dead ends: 12394 [2025-01-09 04:43:25,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:43:25,992 INFO L435 NwaCegarLoop]: 2367 mSDtfsCounter, 19396 mSDsluCounter, 15775 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19396 SdHoareTripleChecker+Valid, 18142 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:25,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19396 Valid, 18142 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:43:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12394 states. [2025-01-09 04:43:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12394 to 8264. [2025-01-09 04:43:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8264 states, 8249 states have (on average 1.3725300036368044) internal successors, (11322), 8263 states have internal predecessors, (11322), 0 states have call successors, (0), 0 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:43:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 11322 transitions. [2025-01-09 04:43:26,157 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 11322 transitions. Word has length 67 [2025-01-09 04:43:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:26,158 INFO L471 AbstractCegarLoop]: Abstraction has 8264 states and 11322 transitions. [2025-01-09 04:43:26,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:43:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 11322 transitions. [2025-01-09 04:43:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:26,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:26,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:26,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:43:26,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1877034391, now seen corresponding path program 1 times [2025-01-09 04:43:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:26,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697870411] [2025-01-09 04:43:26,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:26,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:26,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:26,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:26,805 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:43:26,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697870411] [2025-01-09 04:43:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697870411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:26,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:26,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:43:26,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381194732] [2025-01-09 04:43:26,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:26,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:43:26,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:26,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:43:26,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:26,808 INFO L87 Difference]: Start difference. First operand 8264 states and 11322 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:29,125 INFO L93 Difference]: Finished difference Result 13525 states and 18899 transitions. [2025-01-09 04:43:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:29,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:29,139 INFO L225 Difference]: With dead ends: 13525 [2025-01-09 04:43:29,140 INFO L226 Difference]: Without dead ends: 13514 [2025-01-09 04:43:29,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:43:29,144 INFO L435 NwaCegarLoop]: 2343 mSDtfsCounter, 15909 mSDsluCounter, 10839 mSDsCounter, 0 mSdLazyCounter, 3378 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15909 SdHoareTripleChecker+Valid, 13182 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 3378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:29,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15909 Valid, 13182 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 3378 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:43:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13514 states. [2025-01-09 04:43:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13514 to 8258. [2025-01-09 04:43:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8258 states, 8243 states have (on average 1.3726798495693315) internal successors, (11315), 8257 states have internal predecessors, (11315), 0 states have call successors, (0), 0 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:43:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11315 transitions. [2025-01-09 04:43:29,421 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11315 transitions. Word has length 68 [2025-01-09 04:43:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:29,421 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11315 transitions. [2025-01-09 04:43:29,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11315 transitions. [2025-01-09 04:43:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:29,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:29,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:29,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:43:29,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:29,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:29,439 INFO L85 PathProgramCache]: Analyzing trace with hash 702049040, now seen corresponding path program 1 times [2025-01-09 04:43:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:29,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364865475] [2025-01-09 04:43:29,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:29,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:29,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:29,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:29,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:29,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364865475] [2025-01-09 04:43:29,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364865475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:29,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:29,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:43:29,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078830647] [2025-01-09 04:43:29,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:29,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:43:29,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:29,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:43:29,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:43:29,954 INFO L87 Difference]: Start difference. First operand 8258 states and 11315 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:32,465 INFO L93 Difference]: Finished difference Result 11502 states and 16008 transitions. [2025-01-09 04:43:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:32,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:32,479 INFO L225 Difference]: With dead ends: 11502 [2025-01-09 04:43:32,480 INFO L226 Difference]: Without dead ends: 9921 [2025-01-09 04:43:32,485 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:43:32,486 INFO L435 NwaCegarLoop]: 1338 mSDtfsCounter, 11155 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11155 SdHoareTripleChecker+Valid, 5876 SdHoareTripleChecker+Invalid, 5223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:32,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11155 Valid, 5876 Invalid, 5223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 5208 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:43:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9921 states. [2025-01-09 04:43:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9921 to 8258. [2025-01-09 04:43:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8258 states, 8243 states have (on average 1.3725585345141331) internal successors, (11314), 8257 states have internal predecessors, (11314), 0 states have call successors, (0), 0 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:43:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11314 transitions. [2025-01-09 04:43:32,613 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11314 transitions. Word has length 68 [2025-01-09 04:43:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:32,613 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11314 transitions. [2025-01-09 04:43:32,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11314 transitions. [2025-01-09 04:43:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:32,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:32,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:43:32,621 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1625518918, now seen corresponding path program 1 times [2025-01-09 04:43:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780683296] [2025-01-09 04:43:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:32,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:32,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:32,902 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:43:32,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:32,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780683296] [2025-01-09 04:43:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780683296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:32,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:32,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692060691] [2025-01-09 04:43:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:32,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:32,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:32,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:32,905 INFO L87 Difference]: Start difference. First operand 8258 states and 11314 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:35,712 INFO L93 Difference]: Finished difference Result 14520 states and 20450 transitions. [2025-01-09 04:43:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:43:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:35,726 INFO L225 Difference]: With dead ends: 14520 [2025-01-09 04:43:35,726 INFO L226 Difference]: Without dead ends: 13203 [2025-01-09 04:43:35,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:43:35,732 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 11757 mSDsluCounter, 4658 mSDsCounter, 0 mSdLazyCounter, 5933 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11757 SdHoareTripleChecker+Valid, 6076 SdHoareTripleChecker+Invalid, 6002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 5933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:35,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11757 Valid, 6076 Invalid, 6002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 5933 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 04:43:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2025-01-09 04:43:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 8258. [2025-01-09 04:43:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8258 states, 8243 states have (on average 1.372437219458935) internal successors, (11313), 8257 states have internal predecessors, (11313), 0 states have call successors, (0), 0 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:43:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11313 transitions. [2025-01-09 04:43:35,924 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11313 transitions. Word has length 68 [2025-01-09 04:43:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:35,924 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11313 transitions. [2025-01-09 04:43:35,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11313 transitions. [2025-01-09 04:43:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:35,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:35,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:43:35,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:35,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1023482213, now seen corresponding path program 1 times [2025-01-09 04:43:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:35,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048634185] [2025-01-09 04:43:35,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:36,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:36,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:36,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:36,535 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:43:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:36,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048634185] [2025-01-09 04:43:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048634185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:36,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170426255] [2025-01-09 04:43:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:36,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:36,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:36,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:36,538 INFO L87 Difference]: Start difference. First operand 8258 states and 11313 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:40,214 INFO L93 Difference]: Finished difference Result 14300 states and 19971 transitions. [2025-01-09 04:43:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:40,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:40,225 INFO L225 Difference]: With dead ends: 14300 [2025-01-09 04:43:40,226 INFO L226 Difference]: Without dead ends: 12941 [2025-01-09 04:43:40,228 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:43:40,229 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 11074 mSDsluCounter, 6092 mSDsCounter, 0 mSdLazyCounter, 8369 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11074 SdHoareTripleChecker+Valid, 7471 SdHoareTripleChecker+Invalid, 8470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 8369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:40,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11074 Valid, 7471 Invalid, 8470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 8369 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 04:43:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12941 states. [2025-01-09 04:43:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12941 to 8258. [2025-01-09 04:43:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8258 states, 8243 states have (on average 1.3723159044037365) internal successors, (11312), 8257 states have internal predecessors, (11312), 0 states have call successors, (0), 0 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:43:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11312 transitions. [2025-01-09 04:43:40,327 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11312 transitions. Word has length 68 [2025-01-09 04:43:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:40,327 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11312 transitions. [2025-01-09 04:43:40,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11312 transitions. [2025-01-09 04:43:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:40,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:40,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:43:40,332 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:40,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -53728106, now seen corresponding path program 1 times [2025-01-09 04:43:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422504650] [2025-01-09 04:43:40,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:40,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:40,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:40,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:40,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:40,879 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:43:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422504650] [2025-01-09 04:43:40,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422504650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:40,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:40,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:43:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132305209] [2025-01-09 04:43:40,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:40,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:43:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:40,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:43:40,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:40,881 INFO L87 Difference]: Start difference. First operand 8258 states and 11312 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:42,508 INFO L93 Difference]: Finished difference Result 12205 states and 17038 transitions. [2025-01-09 04:43:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:42,524 INFO L225 Difference]: With dead ends: 12205 [2025-01-09 04:43:42,525 INFO L226 Difference]: Without dead ends: 12197 [2025-01-09 04:43:42,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:43:42,528 INFO L435 NwaCegarLoop]: 2565 mSDtfsCounter, 14962 mSDsluCounter, 13607 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14962 SdHoareTripleChecker+Valid, 16172 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:42,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14962 Valid, 16172 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:43:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12197 states. [2025-01-09 04:43:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12197 to 8250. [2025-01-09 04:43:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8250 states, 8236 states have (on average 1.3723895094706169) internal successors, (11303), 8249 states have internal predecessors, (11303), 0 states have call successors, (0), 0 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:43:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8250 states to 8250 states and 11303 transitions. [2025-01-09 04:43:42,719 INFO L78 Accepts]: Start accepts. Automaton has 8250 states and 11303 transitions. Word has length 68 [2025-01-09 04:43:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:42,719 INFO L471 AbstractCegarLoop]: Abstraction has 8250 states and 11303 transitions. [2025-01-09 04:43:42,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 8250 states and 11303 transitions. [2025-01-09 04:43:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:42,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:42,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:42,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:43:42,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:42,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1836776824, now seen corresponding path program 1 times [2025-01-09 04:43:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:42,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189671744] [2025-01-09 04:43:42,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:42,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:42,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:42,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:42,880 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:43:42,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:42,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189671744] [2025-01-09 04:43:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189671744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:42,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16876336] [2025-01-09 04:43:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:42,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:42,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:42,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:42,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:42,882 INFO L87 Difference]: Start difference. First operand 8250 states and 11303 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:43,031 INFO L93 Difference]: Finished difference Result 12108 states and 16869 transitions. [2025-01-09 04:43:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:43,042 INFO L225 Difference]: With dead ends: 12108 [2025-01-09 04:43:43,042 INFO L226 Difference]: Without dead ends: 7429 [2025-01-09 04:43:43,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:43,050 INFO L435 NwaCegarLoop]: 2029 mSDtfsCounter, 1980 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:43,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 2701 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2025-01-09 04:43:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7411. [2025-01-09 04:43:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7411 states, 7401 states have (on average 1.3873800837724632) internal successors, (10268), 7410 states have internal predecessors, (10268), 0 states have call successors, (0), 0 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:43:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7411 states to 7411 states and 10268 transitions. [2025-01-09 04:43:43,153 INFO L78 Accepts]: Start accepts. Automaton has 7411 states and 10268 transitions. Word has length 68 [2025-01-09 04:43:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:43,153 INFO L471 AbstractCegarLoop]: Abstraction has 7411 states and 10268 transitions. [2025-01-09 04:43:43,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:43:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7411 states and 10268 transitions. [2025-01-09 04:43:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:43,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:43,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:43:43,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash 837543786, now seen corresponding path program 1 times [2025-01-09 04:43:43,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:43,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259028038] [2025-01-09 04:43:43,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:43,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:43,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:43,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:43,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:43,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:43,232 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:43:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259028038] [2025-01-09 04:43:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259028038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651831452] [2025-01-09 04:43:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:43,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:43,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:43,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:43,235 INFO L87 Difference]: Start difference. First operand 7411 states and 10268 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:43,403 INFO L93 Difference]: Finished difference Result 11894 states and 16765 transitions. [2025-01-09 04:43:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:43,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:43:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:43,414 INFO L225 Difference]: With dead ends: 11894 [2025-01-09 04:43:43,414 INFO L226 Difference]: Without dead ends: 7104 [2025-01-09 04:43:43,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:43,422 INFO L435 NwaCegarLoop]: 1621 mSDtfsCounter, 1599 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:43,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 2135 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2025-01-09 04:43:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 7096. [2025-01-09 04:43:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 7089 states have (on average 1.404429397658344) internal successors, (9956), 7095 states have internal predecessors, (9956), 0 states have call successors, (0), 0 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:43:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 9956 transitions. [2025-01-09 04:43:43,509 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 9956 transitions. Word has length 69 [2025-01-09 04:43:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:43,509 INFO L471 AbstractCegarLoop]: Abstraction has 7096 states and 9956 transitions. [2025-01-09 04:43:43,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 9956 transitions. [2025-01-09 04:43:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:43,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:43,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:43:43,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:43,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:43,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1076361939, now seen corresponding path program 1 times [2025-01-09 04:43:43,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:43,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290609504] [2025-01-09 04:43:43,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:43,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:43,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:43,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:43,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:43,616 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:43:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:43,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290609504] [2025-01-09 04:43:43,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290609504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:43,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:43,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:43,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147480608] [2025-01-09 04:43:43,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:43,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:43,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:43,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:43,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:43,619 INFO L87 Difference]: Start difference. First operand 7096 states and 9956 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:43,690 INFO L93 Difference]: Finished difference Result 11514 states and 16805 transitions. [2025-01-09 04:43:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:43,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:43:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:43,702 INFO L225 Difference]: With dead ends: 11514 [2025-01-09 04:43:43,702 INFO L226 Difference]: Without dead ends: 8111 [2025-01-09 04:43:43,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:43,708 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 995 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:43,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 2442 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8111 states. [2025-01-09 04:43:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8111 to 6624. [2025-01-09 04:43:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 6617 states have (on average 1.4293486474233037) internal successors, (9458), 6623 states have internal predecessors, (9458), 0 states have call successors, (0), 0 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:43:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 9458 transitions. [2025-01-09 04:43:43,786 INFO L78 Accepts]: Start accepts. Automaton has 6624 states and 9458 transitions. Word has length 69 [2025-01-09 04:43:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:43,786 INFO L471 AbstractCegarLoop]: Abstraction has 6624 states and 9458 transitions. [2025-01-09 04:43:43,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6624 states and 9458 transitions. [2025-01-09 04:43:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:43,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:43,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:43:43,790 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 208509551, now seen corresponding path program 1 times [2025-01-09 04:43:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141977356] [2025-01-09 04:43:43,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:43,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:43,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:43,874 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:43:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141977356] [2025-01-09 04:43:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141977356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495793690] [2025-01-09 04:43:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:43,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:43,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:43,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:43,876 INFO L87 Difference]: Start difference. First operand 6624 states and 9458 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:43,992 INFO L93 Difference]: Finished difference Result 14604 states and 21367 transitions. [2025-01-09 04:43:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:43:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:44,006 INFO L225 Difference]: With dead ends: 14604 [2025-01-09 04:43:44,007 INFO L226 Difference]: Without dead ends: 10533 [2025-01-09 04:43:44,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:44,016 INFO L435 NwaCegarLoop]: 1783 mSDtfsCounter, 1030 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:44,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 3088 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10533 states. [2025-01-09 04:43:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10533 to 10525. [2025-01-09 04:43:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10525 states, 10518 states have (on average 1.4368701274006466) internal successors, (15113), 10524 states have internal predecessors, (15113), 0 states have call successors, (0), 0 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:43:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10525 states to 10525 states and 15113 transitions. [2025-01-09 04:43:44,143 INFO L78 Accepts]: Start accepts. Automaton has 10525 states and 15113 transitions. Word has length 69 [2025-01-09 04:43:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:44,144 INFO L471 AbstractCegarLoop]: Abstraction has 10525 states and 15113 transitions. [2025-01-09 04:43:44,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 10525 states and 15113 transitions. [2025-01-09 04:43:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:44,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:44,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:43:44,149 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:44,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1908328951, now seen corresponding path program 1 times [2025-01-09 04:43:44,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:44,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231487887] [2025-01-09 04:43:44,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:44,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:44,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:44,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:44,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:44,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:44,219 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:43:44,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:44,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231487887] [2025-01-09 04:43:44,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231487887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:44,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:44,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234448770] [2025-01-09 04:43:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:44,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:44,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:44,221 INFO L87 Difference]: Start difference. First operand 10525 states and 15113 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:44,367 INFO L93 Difference]: Finished difference Result 24885 states and 36375 transitions. [2025-01-09 04:43:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:44,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:43:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:44,386 INFO L225 Difference]: With dead ends: 24885 [2025-01-09 04:43:44,387 INFO L226 Difference]: Without dead ends: 17160 [2025-01-09 04:43:44,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:44,397 INFO L435 NwaCegarLoop]: 1827 mSDtfsCounter, 921 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:44,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 3076 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17160 states. [2025-01-09 04:43:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17160 to 17152. [2025-01-09 04:43:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17152 states, 17145 states have (on average 1.4305628463108777) internal successors, (24527), 17151 states have internal predecessors, (24527), 0 states have call successors, (0), 0 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:43:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17152 states to 17152 states and 24527 transitions. [2025-01-09 04:43:44,623 INFO L78 Accepts]: Start accepts. Automaton has 17152 states and 24527 transitions. Word has length 69 [2025-01-09 04:43:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:44,623 INFO L471 AbstractCegarLoop]: Abstraction has 17152 states and 24527 transitions. [2025-01-09 04:43:44,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:43:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 17152 states and 24527 transitions. [2025-01-09 04:43:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:43:44,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:44,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:43:44,628 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:44,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash -736488177, now seen corresponding path program 1 times [2025-01-09 04:43:44,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:44,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299228678] [2025-01-09 04:43:44,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:44,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:44,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:43:44,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:43:44,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:44,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:44,690 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:43:44,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:44,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299228678] [2025-01-09 04:43:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299228678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443757190] [2025-01-09 04:43:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:44,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:44,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:44,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:44,692 INFO L87 Difference]: Start difference. First operand 17152 states and 24527 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:43:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:44,864 INFO L93 Difference]: Finished difference Result 33874 states and 49224 transitions. [2025-01-09 04:43:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:43:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:44,885 INFO L225 Difference]: With dead ends: 33874 [2025-01-09 04:43:44,885 INFO L226 Difference]: Without dead ends: 18735 [2025-01-09 04:43:44,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:44,902 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1459 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:44,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 2178 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18735 states. [2025-01-09 04:43:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18735 to 15043. [2025-01-09 04:43:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15043 states, 15036 states have (on average 1.4511173184357542) internal successors, (21819), 15042 states have internal predecessors, (21819), 0 states have call successors, (0), 0 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:43:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 21819 transitions. [2025-01-09 04:43:45,112 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 21819 transitions. Word has length 70 [2025-01-09 04:43:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:45,112 INFO L471 AbstractCegarLoop]: Abstraction has 15043 states and 21819 transitions. [2025-01-09 04:43:45,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:43:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 21819 transitions. [2025-01-09 04:43:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:43:45,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:45,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:45,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:43:45,116 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1726166193, now seen corresponding path program 1 times [2025-01-09 04:43:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275601969] [2025-01-09 04:43:45,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:45,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:45,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:43:45,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:43:45,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:45,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:45,175 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:43:45,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:45,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275601969] [2025-01-09 04:43:45,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275601969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:45,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:45,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:45,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659978428] [2025-01-09 04:43:45,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:45,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:45,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:45,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:45,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:45,177 INFO L87 Difference]: Start difference. First operand 15043 states and 21819 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:43:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:45,370 INFO L93 Difference]: Finished difference Result 30928 states and 45366 transitions. [2025-01-09 04:43:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:43:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:45,445 INFO L225 Difference]: With dead ends: 30928 [2025-01-09 04:43:45,445 INFO L226 Difference]: Without dead ends: 16899 [2025-01-09 04:43:45,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:45,454 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 1083 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:45,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1896 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16899 states. [2025-01-09 04:43:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16899 to 13704. [2025-01-09 04:43:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13704 states, 13697 states have (on average 1.4629480908228079) internal successors, (20038), 13703 states have internal predecessors, (20038), 0 states have call successors, (0), 0 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:43:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13704 states to 13704 states and 20038 transitions. [2025-01-09 04:43:45,587 INFO L78 Accepts]: Start accepts. Automaton has 13704 states and 20038 transitions. Word has length 70 [2025-01-09 04:43:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:45,587 INFO L471 AbstractCegarLoop]: Abstraction has 13704 states and 20038 transitions. [2025-01-09 04:43:45,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:43:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13704 states and 20038 transitions. [2025-01-09 04:43:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:43:45,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:45,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:45,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:43:45,590 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:45,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash 246166670, now seen corresponding path program 1 times [2025-01-09 04:43:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884910142] [2025-01-09 04:43:45,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:45,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:45,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:43:45,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:43:45,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:45,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:45,828 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:43:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884910142] [2025-01-09 04:43:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884910142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836720820] [2025-01-09 04:43:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:45,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:45,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:45,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:45,829 INFO L87 Difference]: Start difference. First operand 13704 states and 20038 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:43:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:47,404 INFO L93 Difference]: Finished difference Result 24430 states and 35556 transitions. [2025-01-09 04:43:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:47,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:43:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:47,427 INFO L225 Difference]: With dead ends: 24430 [2025-01-09 04:43:47,427 INFO L226 Difference]: Without dead ends: 23894 [2025-01-09 04:43:47,434 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:43:47,434 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 6874 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 3424 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6874 SdHoareTripleChecker+Valid, 3454 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:47,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6874 Valid, 3454 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3424 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 04:43:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23894 states. [2025-01-09 04:43:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23894 to 13704. [2025-01-09 04:43:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13704 states, 13697 states have (on average 1.4628020734467402) internal successors, (20036), 13703 states have internal predecessors, (20036), 0 states have call successors, (0), 0 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:43:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13704 states to 13704 states and 20036 transitions. [2025-01-09 04:43:47,616 INFO L78 Accepts]: Start accepts. Automaton has 13704 states and 20036 transitions. Word has length 71 [2025-01-09 04:43:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:47,616 INFO L471 AbstractCegarLoop]: Abstraction has 13704 states and 20036 transitions. [2025-01-09 04:43:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:43:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 13704 states and 20036 transitions. [2025-01-09 04:43:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:43:47,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:47,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:47,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:43:47,619 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -168991978, now seen corresponding path program 1 times [2025-01-09 04:43:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:47,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13557688] [2025-01-09 04:43:47,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:47,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:43:47,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:43:47,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:47,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:47,846 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:43:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13557688] [2025-01-09 04:43:47,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13557688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:47,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:47,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:47,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697694994] [2025-01-09 04:43:47,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:47,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:47,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:47,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:47,847 INFO L87 Difference]: Start difference. First operand 13704 states and 20036 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:43:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:49,108 INFO L93 Difference]: Finished difference Result 17715 states and 25749 transitions. [2025-01-09 04:43:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:49,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:43:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:49,172 INFO L225 Difference]: With dead ends: 17715 [2025-01-09 04:43:49,172 INFO L226 Difference]: Without dead ends: 17317 [2025-01-09 04:43:49,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:43:49,174 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 7245 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 2743 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7245 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:49,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7245 Valid, 3309 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2743 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:43:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17317 states. [2025-01-09 04:43:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17317 to 13704. [2025-01-09 04:43:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13704 states, 13697 states have (on average 1.4626560560706725) internal successors, (20034), 13703 states have internal predecessors, (20034), 0 states have call successors, (0), 0 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:43:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13704 states to 13704 states and 20034 transitions. [2025-01-09 04:43:49,302 INFO L78 Accepts]: Start accepts. Automaton has 13704 states and 20034 transitions. Word has length 71 [2025-01-09 04:43:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:49,302 INFO L471 AbstractCegarLoop]: Abstraction has 13704 states and 20034 transitions. [2025-01-09 04:43:49,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 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:43:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13704 states and 20034 transitions. [2025-01-09 04:43:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:43:49,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:49,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:49,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:43:49,306 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-01-09 04:43:49,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash -331643833, now seen corresponding path program 1 times [2025-01-09 04:43:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:49,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692895299] [2025-01-09 04:43:49,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:49,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:49,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:43:49,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:43:49,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:49,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:49,513 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:43:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:49,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692895299] [2025-01-09 04:43:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692895299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:49,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103666124] [2025-01-09 04:43:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:49,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:49,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:49,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:49,515 INFO L87 Difference]: Start difference. First operand 13704 states and 20034 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)